Scalable graphics image drawings on multiresolution image with/without image data re-usage

ABSTRACT

A method and apparatus for creating a background or foreground image at different resolutions with a scalable graphic thereon is described. In one embodiment, the method comprises selecting a version of an image for display with a scalable graphic. The version of the image is at one of a plurality of resolutions. The method also includes generating the version of the image from a first image bitstream from which versions of the image at two or more of the plurality of resolutions could be generated. One of the versions is generated using a first portion of the first image bitstream and a second of the versions is generated using the first portion of the first image bitstream and a second portion of the first image bitstream.

[0001] This application claims the benefit of U.S. Provisional Application No. 60/203,494, entitled “Scalable Vector Graphics (Svg) Drawings on Multiresolution Background Image/Background Alpha with/without Image Data Re-Usage Function,” filed May 11, 2000.

[0002] A portion of the disclosure of this patent document contains material which is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by any one of the patent document or the patent disclosure, as it appears in the Patent and Trademark Office patent file or records, but otherwise reserves all copyright rights whatsoever.

FIELD OF THE INVENTION

[0003] The present invention relates to the field of image processing.

BACKGROUND OF THE INVENTION

[0004] Today, images may be used as background or by themselves. Individuals may also put graphics on such images. One current standard being developed to place graphics on images is the Scalable Vector Graphics (SVG) 1.0 Specification, W3C (MIT, INRIA, Keio) Working Draft, Nov. 2, 2000, which is a language for describing 2-dimensional vector and mixed vector/rastor graphics in extensible markup language (XML). Specifically, Section 15.6, entitled “Accessing the background image,” discusses the use of a background image and a background alpha. FIG. 1 illustrates a SVG graphic drawn on a background image and background alpha. Referring to FIG. 1, SVG describes the graphic in XML. FIG. 2 illustrates a current SVG-based system that uses X-link to place a graphic (SVG 110) on an image bitstream. The graphics 110 may come from a server and may or may not be the same size on each of images 101-103. The graphic 110 may also include additional graphics for each of images 101-103. An example SVG code is shown below. <?)anl version=″1.0″ encoding=″iso-BB59-1″?> <!DOCTYPE svg PUBLIC ″-//W3C//DTD SVG 03December 1999//EN″    .http: //www.w3.org/Graphics/SVG/SVG-19991203.dtd″> <svg )anl:space=″.preserve″ width=.4in. height=″6in″> <defs> <filter id=.EtchedGlass″ filterUnits=″objectBoundingBox″ x=″−10%″    y=″−10%″ width=″120%″ height=″120%″> <!−−Copyright 1999 Adobe Systems. You may copy, modify, and distri- bute this file, if you include this notice & do not charge for the distribu- tion. This file is provided ″AS-IS″ without warranties of any kind, including any implied warranties.−−> <feGaussianBlur in=″SourceAlpha″  stdDeviation=″4.  result=″blur″/>    <feOffset in=″blur″ dx=″10. dy = ″B″ result= ″offsetBlurredAlpha″/> <feSpecularLighting in=″blur. surfaceScale=″5″ specularConstant=″1″    specularExponent=.7. lightColor=″white″ result=″specularOut″> <fePointLight x=″−5000″ y=″−10000″ z=″20000″/> </feSpecularLighting> <feTurbulence type=″turbulence″ baseFrequency=.O.Ol. numOctaves= ″10. result=″turb″/> <feColorMatrix type=″matrix″ in=″turb.    result=″turbulence″    values=.10 O O O 100 O O 10 O O O O O O O 1″/> <feComposite in=″turbulence″ in2=″specularOut″ operator=″in″ result=″specularOut″/;> <feComposite in=″specularOut″ in2=″SourceAlpha″ operator=″in″ result=″specularOut″/> <feComposite in=″SourceGraphic″ in2=″specularOut″ operator=″arithmetic″    k1=″O″ k2=″1. k3˜″1.5. k4=″−.5″ result=″litPaint./> <feColorMatrix type=″matrix. in=.litPaint. result=.litPaint″    values=.10 O O O O 10 O O O O 100 O O O O .6″/> <feComposite in=.litPaint. in2=″Sour'ceAlpha. bperator=.in. result=.litPaint″1> <feMerge> <feMergeNode in=”offsetBlurredAlpha”/> <feMergeNode in=”litPaint”/> </feMerge> </filter> <linearGradient id=″relativeLinear″ gradientUnits=″objectBoundingBox″    x1=″O″ y1=″1″ x2=″O″ y2=″0″> <stop offset=″O″ style=″stop-color:wheat″/> <stop offset=″1″ style=″stop-color:skyblue″/> </linearGradient> </defs> <g> <image style=Hopacity:.3″ X=″OH y=″OH width=H6OOH height= H6OOH xlink:href=Hstreetb.jpg″/> <text x=H2OH y=″15O″ style=″dpacity: .7; font-family: ‘Times’;font-size:18O;    filter:url(#EtchedGlass) ;fill:url(#relativeLinear) ″>SVG</text> </g> </svg>

[0005] Adobe_example1..svg

[0006] To put the graphic on to the image, the image of the image bitstream may be resized, such as shown in images 101-103. (Note that the size of the graphic may be the same or different on all three versions). Each of the images 121-123 is generated from the same bitstream. As the images are resized to be larger, the quality becomes lower. This is problematic.

SUMMARY OF THE INVENTION

[0007] A method and apparatus for creating a background or foreground image at different sizes with a scalable (in size) graphic thereon is described. In one embodiment, the method comprises selecting a version of an image (e.g., a background image, a foreground image) for display with a scalable graphic. The version of the image may be one of multiple sizes. The method also includes generating the version of the image from a first image bitstream from which versions of the image at two or more of the sizes could be generated. One of the versions is generated using a first portion of the first image bitstream and a second of the versions is generated using the first portion of the first image bitstream and a second portion of the first image bitstream.

[0008] In another embodiment, the versions of the image at multiple sizes include a predetermined set of versions and the selection of the version that is displayed is the version with the highest quality among all the versions that may be created for the bandwidth that is available. In still another embodiment, the same is true for the scalable graphic. That is, a version of the scalable graphic is selected that is the highest quality available out of multiple versions of the scalable graphic for the bandwidth that is available.

BRIEF DESCRIPTION OF THE DRAWINGS

[0009] The present invention will be understood more fully from the detailed description given below and from the accompanying drawings of various embodiments of the invention, which, however, should not be taken to limit the invention to the specific embodiments, but are for explanation and understanding only.

[0010]FIG. 1 illustrates an SVG graphic drawn on a background alpha.

[0011]FIG. 2 illustrates images with different resolutions under the current SVG-based system that uses X-link to place a graphic on an image bitstream.

[0012]FIG. 3A illustrates creating drawings with different resolutions of a background image with a graphic.

[0013]FIG. 3B illustrates one embodiment of a pyramidal representation of the image bitstream.

[0014]FIG. 3C illustrates each portion of an image bitstream being stored separately.

[0015]FIG. 3D illustrates an example of using two image bitstreams and data re-use to create images.

[0016]FIG. 3E illustrates storage of two bitstreams.

[0017]FIG. 4 is a block diagram of a distributed computer system, including a web server and a number of client computers, for distributing multi-resolution images to the client computers.

[0018]FIG. 5 is a block diagram of a computer system in accordance with an embodiment of the present invention.

[0019]FIG. 6A schematically depicts the process of transforming a raw image into a transform image array and compressing the transform image array into a compressed image file.

[0020]FIG. 6B depicts a mapping of spatial frequency subbands to NQS subbands used for encoding transform coefficients.

[0021]FIG. 7 is a conceptual representation of the encoded data that represents an image, organized to facilitate multi-resolution regeneration of the image (i.e., at multiple resolution levels).

[0022]FIGS. 8A, 8B, 8C, 8D and 8E depict image storage data structures.

[0023]FIG. 9 is a high level flow chart of an image processing process to which the present invention can be applied.

[0024]FIGS. 10A, 10B and 10C graphically depict a forward and inverse wavelet-like data transformation procedure.

[0025]FIG. 11 depicts the spatial frequency subbands of wavelet coefficients generated by applying multiple layers of a decomposition wavelet or wavelet-like transform to an array of image data.

[0026]FIG. 12 depicts a flow chart of a block classification method for selecting a set of quantization divisors for a block of an image.

[0027]FIGS. 13A and 13B depict a flow chart of a procedure for encoding the transform coefficients for a block of an image.

[0028]FIGS. 14A, 14B and 14C depict a method of encoding values, called MaxbitDepth values in a preferred embodiment, which represent the number of bits required to encode the transform coefficients in each block and subblock of an encoded image.

[0029]FIG. 15 is a high level flow chart of a compressed image reconstruction process to which the present invention can be applied.

[0030]FIGS. 16A and 16B depict a flow chart of a procedure for decoding the transform coefficients for an image and for reconstructing an image from the coefficients.

[0031]FIG. 17 is a block diagram of a digital camera in which one or more aspects of the present invention are implemented.

[0032]FIG. 18 is a conceptual flow chart of a client computer downloading a thumbnail image, then zooming in on the image, and then panning to a new part of the image.

DETAILED DESCRIPTION OF THE PRESENT INVENTION

[0033] A method and apparatus for creating a background or foreground image at different resolutions with a scalable (in size) graphic thereon is described. In one embodiment, the method comprises selecting a version of an image for display with a scalable graphic. The version of the image is at one of multiple resolutions. The method also includes generating the version of the image from a first image bitstream from which versions of the image at two or more of the plurality of resolutions could be generated. One of the versions is generated using a first portion of the first image bitstream and a second of the versions is generated using the first portion of the first image bitstream and a second portion of the first image bitstream.

[0034] In an alternative embodiment, still another version of the image is generated from a second image bitstream from which versions of the image at two or more additional resolutions could be generated. A first of the versions is generated using a first portion of the second image bitstream and a second of the versions is generated using the first portion of the second image bitstream and a second portion of the second image bitstream.

[0035] In one embodiment, the quality of the second version of the image is at least as good as quality of the first version of the image. For example, the second version of the image may be enhanced in size and resolution in comparison to the first version of the image.

[0036] In one embodiment, the graphic comprises a Scalable Vector Graphics (SVG) graphic. The SVG graphic (or another type of graphic) may be placed on a multiresolution background image or background alpha with or without data reuse, as described in more detail below. However, other graphics may be used, including those that do not conform to the SVG standard.

[0037] In the following description, numerous details are set forth to provide a thorough understanding of the present invention. It will be apparent, however, to one skilled in the art, that the present invention may be practiced without these specific details. In other instances, well-known structures and devices are shown in block diagram form, rather than in detail, in order to avoid obscuring the present invention.

[0038] Some portions of the detailed descriptions which follow are presented in terms of algorithms and symbolic representations of operations on data bits within a computer memory. These algorithmic descriptions and representations are the means used by those skilled in the data processing arts to most effectively convey the substance of their work to others skilled in the art. An algorithm is here, and generally, conceived to be a self-consistent sequence of steps leading to a desired result. The steps are those requiring physical manipulations of physical quantities. Usually, though not necessarily, these quantities take the form of electrical or magnetic signals capable of being stored, transferred, combined, compared, and otherwise manipulated. It has proven convenient at times, principally for reasons of common usage, to refer to these signals as bits, values, elements, symbols, characters, terms, numbers, or the like.

[0039] It should be borne in mind, however, that all of these and similar terms are to be associated with the appropriate physical quantities and are merely convenient labels applied to these quantities. Unless specifically stated otherwise as apparent from the following discussion, it is appreciated that throughout the description, discussions utilizing terms such as “processing” or “computing” or “calculating” or “determining” or “displaying” or the like, refer to the action and processes of a computer system, or similar electronic computing device, that manipulates and transforms data represented as physical (electronic) quantities within the computer system's registers and memories into other data similarly represented as physical quantities within the computer system memories or registers or other such information storage, transmission or display devices.

[0040] The present invention also relates to apparatus for performing the operations herein. This apparatus may be specially constructed for the required purposes, or it may comprise a general purpose computer selectively activated or reconfigured by a computer program stored in the computer. Such a computer program may be stored in a computer readable storage medium, such as, but is not limited to, any type of disk including floppy disks, optical disks, CD-ROMs, and magnetic-optical disks, read-only memories (ROMs), random access memories (RAMs), EPROMs, EEPROMs, magnetic or optical cards, or any type of media suitable for storing electronic instructions, and each coupled to a computer system bus.

[0041] The algorithms and displays presented herein are not inherently related to any particular computer or other apparatus. Various general purpose systems may be used with programs in accordance with the teachings herein, or it may prove convenient to construct more specialized apparatus to perform the required method steps. The required structure for a variety of these systems will appear from the description below. In addition, the present invention is not described with reference to any particular programming language. It will be appreciated that a variety of programming languages may be used to implement the teachings of the invention as described herein.

[0042] A machine-readable medium includes any mechanism for storing or transmitting information in a form readable by a machine (e.g., a computer). For example, a machine-readable medium includes read only memory (“ROM”); random access memory (“RAM”); magnetic disk storage media; optical storage media; flash memory devices; electrical, optical, acoustical or other form of propagated signals (e.g., carrier waves, infrared signals, digital signals, etc.); etc.

[0043] Overview

[0044] The present invention provides for creating drawings with different resolutions of a background image with a graphic according to, for example, the Scalable Vector Graphics (SVG) 1.0 Specification, W3C (MIT, INRIA, Keio) Working Draft, Nov. 2, 2000. Such an embodiment is shown in FIG. 3A. Referring to FIG. 3A, a portion (A) of a single image bitstream 320 is used to create image 301 having an SVG graphic 310.

[0045] In one embodiment, SVG graphic 310 is described in XML. The system creating these images may use x-link to place graphics 310 on the image. In such a case, graphic 310 may be stored and supplied by a server.

[0046] To create a larger view of a portion of the image, shown as image 302, with the SVG graphic 310, additional data (B′) from the image bitstream is used with the portion (A) of the image bitstream that was used to create image 301. In one embodiment, this is done using a scalable compressed bitstream and a compression scheme such as described in, for example, U.S. Pat. No. 6,041,143, entitled “Multiresolution Compress Image Management System and Method,” issued Mar. 21, 2000 and assigned to the corporate assignee of the present invention. In alternative embodiments, a scalable compression bitstream such as, for example, wavelet compression in the JPEG-2000 Standard, or compression schemes described in U.S. Pat. Nos. 5,909,518 and 5,949,911, or in U.S. patent application Ser. No. 09/687,467, entitled “Multiresolution Image Data Management System and Method Based on Tiled Wavelet-like Transform and Sparse Data Coding, filed _(______), and assigned to the corporate assignee of the present invention, may be used. Also, in an alternative embodiment, the image bitstream may be in the FlashPix format as described in FlashPix Format Specification, version 1.01, Eastman Kodak Company, July 1997.

[0047] Similarly, additional data C′ from the same image bitstream is combined with the image data A and B′ to create image 303 which represents an enlarged version.

[0048] The compressed image bitstream may be pyramidal in nature such that each level of decomposition represents the image at a different resolution. Such as shown in FIG. 3B. Only the lowest level of decomposition needs to be stored as all other levels may be generated from it. In an alternative embodiment, each portion of the image data (e.g., A, B′, C′) may be stored separately, such as shown in FIG. 3C.

[0049] It should be noted that because of the nature of the bitstream, if a separate bitstream was used to create image 302, the amount of data to do so would be much greater than the image data B′ that is added to image data A. Similarly, if a separate bitstream is used to create image 303, the amount of data to represent that image in the bitstream would be much much greater than the image data C′ used to create image 303.

[0050] In an alternative embodiment, multiple bitstreams may be used and combined with data re-use to enable multiple image enhancements to be created. FIG. 3D illustrates such an example using two image bitstreams 420, one to create images 401 and 402 and the other to create image 403 and 404. Each of images 401-404 includes a graphic, such as SVG graphic 310. As discussed above, in one embodiment, SVG graphic 310 is described in XML and the system creating these images uses x-link to place graphic 310 on the images. Referring to FIG. 3D, image 401 is created using data A from a first bitstream. Image 402 is an enlargement of image 401 and is created by reusing data A in combination with data B′ from the first of bitstreams 420. Image 403 is a further enlarged image in comparison to image 402 yet is created with a second of bitstreams 420 using a portion of the second bitstream, image data C. An enlarged version of image 403 is created, shown as image 404, which is created by reusing image data C and combining it with image data D′ for the second bitstream of bitstreams 420. In such a case, two sets of combined data are stored, one corresponding to the combination of image data A and B′ and one corresponding to the combination of image data C and D′. Similarly to FIGS. 3A-3D, the compressed image bitstreams 420 may be pyramided in nature with each level of decomposition representing the image at different resolutions. This is shown in FIG. 3E.

[0051] In another embodiment, the versions of the image at multiple sizes include a predetermined set of versions and the selection of the version that is displayed is the version with the highest quality among all the versions that may be created for the bandwidth that is available. In still another embodiment, the same is true for the scalable graphic. That is, a version of the scalable graphic is selected that is the highest quality available out of multiple versions of the scalable graphic for the bandwidth that is available.

[0052] Exemplary Embodiments

[0053] In one embodiment, the techniques described herein are implemented as a viewer that enables a user to display images at multiple levels of detail. Such a viewer may be supported using an image file and compression technology described in more detail below. Although at least one image file and compression technology are described herein, it would be apparent to those skilled in the art to employ other image file structures and/or different compression technologies.

[0054] In one embodiment, the viewer is implemented as a client-server system. The server stores images. The images may be stored in a compressed format. In one embodiment, the images are compressed according to a block-based integer wavelet transform entropy coding scheme. For more information on one embodiment of the transform, see U.S. Pat. No. 5,909,518, entitled “System and Method for Performing Wavelet-Like and Inverse Wavelet-Like Transformation of Digital Data,” issued Jun. 1, 1999. One embodiment of a block-based transform is described in U.S. Pat. No. 6,229,926, entitled “Memory Saving Wavelet-Like Image Transform System and Method for Digital Camera and Other Memory Conservative Applications,” issued May 8, 2001. One embodiment of scalable coding is described in U.S. Pat. No. 5,949,911, entitled “System and Method for Scalable Coding of Sparse Data Sets,” issued Sep. 7, 1999. One embodiment of block based coding is described in U.S. Pat. No. 5,886,651, entitled “System and Method for Nested Split Coding of Sparse Data Sets,” issued Mar. 23, 1999. Each of these are assigned to the corporate assignee of the present invention and incorporated herein by reference.

[0055] The compressed images are stored in a file structure. In one embodiment, the file structure comprises of a series of sub-images, each one being a predetermined portion of the size of its predecessor (e.g., {fraction (1/16)} of the size of its predecessor). In one embodiment, each sub-picture is made up of a series of blocks that each contains the data associated with a 64×64 pixel block. That is, each image is divided into smaller individual blocks that are 64×64 pixels. Each block contains data for decoding the 64×64 block and information that can be used for extracting the data for a smaller 32×32 block. Accordingly, each sub-image contains two separate resolutions. When the image is compressed, the bit-stream is organized around these 64×64 blocks and software extracts a variety of resolution and/or quality levels from each of these blocks.

[0056] One embodiment of a file structure along with multiresolution compressed image management is described in U.S. Pat. No. 6,041,143, entitled “Multiresolution Compressed Image Management System and Method,” issued Mar. 21, 2000, assigned to the corporate assignee of the present invention and incorporated herein by reference.

[0057] In one embodiment, the system keeps track of which data it already has so that it does not have to request the same data multiple times from the server. In one embodiment, the system keeps track of the images and also what other data is in a cache.

[0058] In one embodiment, the image data is cached locally and reused wherever possible. Caching data locally allows random access to different parts of the image and allows images, or parts of images, to be loaded in a variety of resolution and quality levels. The data need not be cached locally.

[0059] In one embodiment, the system reuses the existing image data together with the new image data to create a high quality higher resolution view. Thus, the system uses a file hierarchy that allows for two resolution levels to be extracted from one sub-image.

[0060] An Exemplary Data Management System

[0061] One embodiment of a data management system that may be used to implement the techniques described herein is described in U.S. patent application Ser. No. 09/687,467, entitled “Multi-resolution Image Data Management System and Method Based on Tiled Wavelet-Like Transform and Sparse Data Coding,” filed Oct. 12, 2000, assigned to the corporate assignee of the present invention.

[0062] In the following description, the terms “wavelet” and “wavelet-like” are used interchangeably. Wavelet like transforms generally have spatial frequency characteristics similar to those of conventional wavelet transforms and are losslessly reversible, but have shorter filters that are more computationally efficient.

[0063] The present invention may be implemented in a variety of devices that process images, including a variety of computer systems, ranging from high end workstations and servers to low end client computers as well as in application specific dedicated devices, such as digital cameras.

[0064] System for Encoding and Distributing Multi-Resolution Images

[0065]FIG. 4 shows a distributed computer system, including a web server 140 and a number of client computers 120 for distributing, multi-resolution images 190 to the client computers via a global communications network 110, such as the Internet, or any other appropriate communications network, such as a local area network or Intranet. An imaging encoding workstation 150 prepares multi-resolution image files for distribution by the web server. In some embodiments, the web server 140 may also perform the image encoding tasks of the image encoding workstation 150.

[0066] A typical client device 120 will be a personal digital assistant, personal computer workstation, or a computer controlled device dedicated to a particular task. The client device 120 will preferably include a central processing unit 122, memory 124 (including high speed random access memory and non-volatile memory such as disk storage) and a network interface or other communications interface 128 for connecting the client device to the web server via the communications network 110. The memory 124, will typically store an operating system 132, a browser application or other image viewing application 134, an image decoder module 180, and multi-resolution image files 190 encoded in accordance with the present invention. In one embodiment, the browser application 134 includes or is coupled to a Java™ (trademark of Sun Microsystems, Inc.) virtual machine for executing Java language programs, and the image decoder module is implemented as a Java™ applet that is dynamically downloaded to the client device along with the image files 190, thereby enabling, the browser to decode the image tiles for viewing.

[0067] The web server 140 will preferably include a central processing unit 142, memory 144 (including high speed random access memory, and non-volatile memory such as disk storage ), and a network interface or other communications interface 148 for connecting the web server to client devices and to the image encoding workstation 150 via the communications network 110. The memory 141 will typically store an http server module 146 for responding to http requests, including request for multi-resolution image files 190.

[0068] The web server 140 may optionally include an image processing module 168 with encoding procedures 172 for encoding images as multi-resolution images.

[0069] Computer System

[0070] Referring to FIG. 5, the image processing workstation 150 may be implemented using a programmed general-purpose computer system. FIG. 5 may also represent the web server, when the web server performs image processing tasks. The computer system 150 may include:

[0071] one or more data processing units (CPU's) 152;

[0072] memory 154 which will typically include both high speed random access memory, as well as non-volatile memory;

[0073] user interface 156 including a display device 157 such as a CRT or LCD type display:

[0074] a network or other communication interface 158 for communicating with other computers as well as other devices;

[0075] data port 160, such as for sending and receiving images to and from a digital camera (although such image transfers might also be accomplished via the network interface 158); and

[0076] one or more communication buses 161 for interconnecting the CPU(s) 152, memory 154, user interface 156, network interface 158 and data port 160.

[0077] The computer system's memory 154 stores procedures and data, typically including:

[0078] an operating system 162 for providing basic system services;

[0079] a file system 164, which may be part of the operating system;

[0080] application programs 166, such as user level programs for viewing and manipulating images.

[0081] an image processing module 168 for performing various image processing functions including those that are described herein;

[0082] image files 190 representing various images; and

[0083] temporary image data arrays 192 for intermediate results generated during image processing and image regeneration.

[0084] The computer 150 may also include a http server module 146 (FIG. 4) when this computer 150 is used both for image processing and distribution of multi-resolution images. The image processing module 168 may include an image encoder module 170 and an image decoder module 180. The image encoder module 170 produces multi-resolution image files 190, the details of which will be discussed below. The image encoder module 170 may include:

[0085] an encoder control program 172 which controls the process of compressing and encoding an image (starting with a raw image array 189, which in turn may be derived from the decoding of an image in another image file format),

[0086] a set of wavelet-like transform procedures 174 for applying wavelet-like filters to image data representing an image;

[0087] a block classifier procedure 176 for determining the quantization divisors to be applied to each block (or band) of transform coefficients for an image;

[0088] a quantizer procedure 178 for quantizing the transform coefficients for an image; and

[0089] a sparse data encoding procedure 179, also known as an entropy encoding procedure, for encoding the quantized transform coefficients generated by the quantizer procedure 178.

[0090] The procedures in the image processing module 168 store partially transformed images and other temporary data in a set of temporary data arrays 192.

[0091] The image decoder module 180 may include:

[0092] a decoder control program 182 for controlling the process of decoding an image file (or portions of the image file) and regenerating the image represented by the data in the image file;

[0093] a sparse data decoding procedure 184 for decoding the encoded, quantized transform coefficients stored in an image file into a corresponding array of quantized transform coefficients;

[0094] a de-quantizer procedure 186 for dequantizing a set of transform coefficients representing a tile of an image; and

[0095] a set of wavelet-like inverse transform procedures 188 for applying wavelet-like inverse filters to a set of dequantized transform coefficients, representing a tile of an image, so as to regenerate that tile of the image.

[0096] Overview of Image Capture and Processing

[0097] Referring to FIG. 6, raw image data 200 obtained from a digital camera's image capture mechanism (FIG. 17) or from an image scanner or other device, is processed by “tiling the image data.” More specifically, the raw image is treated as an array of tiles 202, each tile having a predefined size such as 64×64 (i.e., 64 rows by 64 columns). In other embodiments, other tile sizes, such as 32×32 or 16×32 or 128×128 or 64×128 may be used. The tiles are non-overlapping portions of the image data. A sufficient number of tiles are used to cover the entire raw image that is to be processed, even if some of the tiles overhang the edges of the raw image. The overhanging portions of the tiles are filled with copies of boundary data values during the wavelet transform process, or alternately are filled with null data. Tile positions are specified with respect to an origin at the upper left corner of the image, with the first coordinate indicating the Y position of the tile (or a pixel or coefficient within the tile) and the second coordinate indicating the X position of the tile (or a pixel or coefficient within the tile). Thus, a tile at position 0,128 is located at the top of the image and has its origin at the 128th pixel of the top row of pixels.

[0098] A wavelet or wavelet-like decomposition transform is successively applied to each tile of the image to convert the raw image data in the tile into a set of transform coefficients. When the wavelet-like decomposition transform is a one dimensional transform that is being applied to a two dimensional array of image data, the transform is applied to the image data first in one direction (e.g., the horizontal direction) to produce an intermediate set of coefficients, and then the transform is applied in the other direction (e.g., the vertical direction) to the intermediate set of coefficients so as to produce a final set of coefficients. The final set of coefficients are the result of applying the wavelet-like decomposition transform to the image data in both the horizontal and vertical dimensions.

[0099] The tiles are processed in a predetermined raster scan order. For example, the tiles in a top row are processed going from one end (e.g., the left end) to the opposite end (e.g., the right end), before processing the next row of tiles immediately below it, and continuing until the bottom row of tiles of the raw image data has been processed.

[0100] The transform coefficients for each tile are generated by successive applications of a wavelet-like decomposition transform. A first application of the wavelet decomposition transform to an initial two dimensional array of raw image data generates four sets of coefficients, labeled LL, HL1, LH1 and HH1. Each succeeding application of the wavelet decomposition transform is applied only to the LL set of coefficients generated by the previous wavelet transformation step and generates four new sets of coefficients, labeled LL, HLx, LHx and HHx, where x represents the wavelet transform “layer” or iteration. After the last wavelet decomposition transform iteration only one LL set remains. The total number of coefficients generated is equal to the number of data samples in the original data array. The different sets of coefficients generated by each transform iteration are sometimes called layers. The number of wavelet transform layers generated for an image is typically a function of the resolution of the initial image. For tiles of size 64×64, or 32×32, performing five wavelet transformation layers is typical, producing 16 spatial frequency subbands of data:

[0101] LL₅, HL₅, LH₅, HH₅, HL₄, LH₄, HH₄, HL₃, LH₃, HH₃, HL₂, LH₂, HH₂, HL₁, LH₁, HH₁.

[0102] The number of transform layers may vary from one implementation to another, depending on both the size of the tiles used and the amount of computational resources available. For larger tiles, additional transform layers would likely be used, thereby creating additional subbands of data. Performing more transform layers will often produce better data compression, at the cost of additional computation time, but may also produce additional tile edge artifacts.

[0103] The spatial frequency subbands are grouped as follows. Subband group 0 corresponds to the LL_(N) subband, where N is the number of transform layers applied to the image (or image tile). Each other subband group i contains three subbands, LH_(i), HL_(i), and HH_(i) As will be described in detail below, when the transform coefficients for a tile are encoded, the coefficients from each group of subbands are encoded separately from the coefficients of the other groups of subband. In one embodiment, a pair of bitstreams is generated to represent the coefficients in each group of subbands. One of the bitstreams represents the most significant bit planes of the coefficients in the group of subbands while the second bitstream represents the remaining, least significant bit planes of the coefficients for the group of subbands.

[0104] The wavelet coefficients produced by application of the wavelet-like transform are preferably quantized (by quantizer 178) by dividing the coefficients in each subband of the transformed tile by a respective quantization value (also called the quantization divisor). In one embodiment, a separate quantization divisor is assigned to each subband. More particularly, as will be discussed in more detail below, a block classifier 176 generates one or more values representative of the density of features in each tile of the image, and based on those one or more values, a table of quantization divisors is selected for quantizing the coefficients in the various subbands of the tile.

[0105] The quantized coefficients produced by the quantizer 178 are encoded by a sparse data encoder 179 to produce a set of encoded subimage subfiles 210 for each tile of the image.

[0106] Details of the wavelet-like transforms used in one embodiment are below. Circuitry for performing the wavelet-like transform of the one embodiment is very similar to the wavelet transform and data quantization methods described in U.S. Pat. No. 5,909,518 entitled “System and Method for Performing Wavelet and Inverse Wavelet Like Transformations of Digital Data Using Only Add and Bit Shift Arithmetic Operations,” which is hereby incorporated by reference as background information.

[0107] The sparse data encoding method of the preferred embodiment is called Nested Quadratic Splitting (NQS) and is described in detail below This sparse data encoding method is an unproved version of the NQS sparse data encoding method described in U.S. Pat. No. 5,949,911, entitled “System and Method for Scalable Coding of Sparse Data Sets,” which is hereby incorporated by reference as background information.

[0108]FIG. 6B depicts a mapping of spatial frequency subbands to NQS subbands used for encoding transform coefficients. In particular, in one embodiment, seven spatial frequency subbands (LL₅, HL₅, LH₅, HH₅, HL₄, LH₄, and HH₄) are mapped to a single NQS subband (subband 0) for purposes of encoding the coefficients in these subbands. In other words, the coefficients in these seven spatial frequency subbands are treated as a single top level block for purposes of NQS encoding. In one embodiment, NQS subbands 0, 1, 2 and 3 are encoded as four top level NQS blocks, the most significant bit planes of which are stored in a bitstream representing a lowest resolution level of the image in question.

[0109] Image Resolution Levels and Subimages

[0110] Referring to FIG. 7, an image is stored at a number of resolution levels 0 to N, typically with each resolution level differing from its neighbors by a resolution factor of four. In other words, if the highest resolution representation (at resolution level N) of the image contains X amount of information, the second highest resolution level representation N−1 contains X/4 amount of information, the third highest resolution level representation contains X/16 amount of information, and so on. The number of resolution levels stored in an image file will depend on the size of the highest resolution representation of the image and the minimum acceptable resolution for the thumbnail image at the lowest resolution level. For instance, if the full or highest resolution image is a high definition picture having about 16 million pixels (e.g., a 4096×4096 pixel image), it might be appropriate to have seven resolution levels: 4096×4096, 2048×2048, 1024×1024, 512×512, 256×256, 128×128, and 64×64.

[0111] However, as shown in FIG. 4, one feature or aspect of the present invention is that when a inulti-resolution image has more than, say, three or four resolution levels, the image is encoded and stored in multiple “base image” files, each of which contains the data for two to four of the resolution levels. Alternately, all the base images may be stored in a single file, with each base image being stored in a distinct base image subfile or subfile data structure within the image file.

[0112] Each base image file (or subfle) contains the data for reconstructing a “base image” and one to three subimages (lower resolution levels). For instance, in the example shown in FIG. 7, the image is stored in three tiles, with a first tile storing the image at three resolution levels, including the highest definition level and two lower levels, a second file stores the image at three more resolution levels (the fourth, fifth and sixth highest resolution levels) and a third file stores the image at the two lowest resolution levels, for a total of eight resolution levels. Generally, each successive file will be smaller than the next larger file by a factor of about 2^(2X), where X is the number of resolution levels in the larger file. For instance, if the first file has three resolution levels, the next file will typically be smaller by a factor of 64(2⁶).

[0113] As a result, an image file representing a group of lower resolution levels will be much smaller, and thus much faster to transmit to a client computer, than the image file containing the full resolution image data. For instance, a user of a client computer might initially review a set of thumbnail images, at a lowest resolution level (e.g., 32×32 or 64×64), requiring the client computer to review only the smallest of the three image files, which will typically contain about 0.024% as much data as the highest resolution image file. When the user requests to see the image at a higher resolution, the client computer may receive the second, somewhat larger image file, containing about 64 times as much data as the lowest resolution image file. This second file may contain three resolution levels (e.g., 512×512, 256×256, and 128×128), which may be sufficient for the user's needs. In the event the user needs even higher resolution levels, the highest resolution file will be sent. Depending on the context in which the system is used, the vendor of the images may charge additional fees for downloading each successively higher resolution image file.

[0114] It should be noted that many image files are not square, but rather are rectangular, and that the square image sizes used in the above examples are not intended to in any way to limit the scope of the invention. While the basic unit of information that is processed by the image processing modules is a tile, which is typically a 64×64 or 32×32 array of pixels, any particular image may include an arbitrarily sized array of such tiles. Furthermore, the image need not be an even multiple of the tile size, since the edge tiles can be truncated wherever appropriate.

[0115] The designation of a particular resolution level of an image as the “thumbnail” image may depend on the client device to which the image is being sent. For instance, the thumbnail sent to a personal digital assistant or mobile telephone, which have very small displays, may be much smaller than (for example, one sixteenth the size of) the thumbnail that is sent to a personal computer and the thumbnail sent to a device having a large, high definition screen may be much larger than the thumbnail sent to a personal computer having a display of ordinary size and definition. When an image is to be potentially used with a variety of client devices, additional base images are generated for the image so that each type of device can initially receive an appropriately sized thumbnail image.

[0116] When an image is first requested by a client device, the client device may specify its window size in its request for a thumbnail image or the server may determine the size of the client device's viewing window by querying the client device prior to downloading the thumbnail image data to the client device. As a result, each client device receives a minimum resolution thumbnail that is appropriately sized for that device.

[0117] Image File Data Structures

[0118] Referring to FIGS. 8A through 8E, when all the tiles of an image have been transformed, compressed and encoded, the resulting encoded image data is stored as an image file 190. The image file 190 includes header data 194 and a sequence of base image data structures, sometimes called base image subfiles 196. Each base image subfile 196 typically includes the data for displaying the image at two or more resolution levels. Furthermore, each base image supports a distinct range of resolution levels. The multiple base images and their respective subimages together provide a full range of resolution levels for the image, as conceptually represented in FIG. 4. While the resolution levels supported by the base image levels are non-overlapping in one embodiment, in an alternate embodiment the resolution levels supported by one base image may overlap with tile resolution levels supported by another base image (for the same initial full resolution image).

[0119] In one embodiment, each image file 190 is an html file or similarly formatted web page that contains a link 198, such as an object tag or applet tag, to an applet 199 (e.g., a Java™ applet) that is automatically invoked when the file is downloaded to a client computer. The header 194 and a selected one of the base images 196 are used as data input to the embedded applet 199, which decodes and renders the image on the display of a user's personal digital assistant or computer. The operation of the applet is transparent to the user, who simply sees the image rendered on his/her computer display. Alternately, the applet may present the user with a menu of options including the resolution levels available with the base image subfile or subfiles included in the image file, additional base image subfiles that may be available from the server, as well as other options such as image cropping options.

[0120] In an alternate embodiment, the client workstations include an application, such as a browser plug-in application, for decoding and rendering images in the file format of the present invention. Further, each image file 210 has an associated data type that corresponds to the plug-in application. The image file 210 is downloaded along with an html or similarly formatted web page that includes an embed tag or object tag that points to the image file. As a result, when the web page is downloaded to a client workstation, the plug-in application is automatically invoked and executed by the client computer's. As a result, the image file is decoded and rendered and the operation of the plug-in application is transparent to the user.

[0121] The image file 190-A shown in FIG. 8A represents one possible way of storing a multi-resolution image, and is particularly suitable for storing a multi-resolution image in a server. In a client computer, the image file 190-B as shown in FIG. 8B may contain only one base image 196. In addition, the client version of the image file 190 may contain a link 201 to the image file 190-A in the server. The link 201 is used to enable a user of the client computer to download other base images (at other resolution levels) of the same image. Alternately, the link 201 is a Java™ (trademark of Sun Microsystems) script for requesting an image file containing any of the higher resolution base images from the web server. If there is a charge for obtaining the higher resolution image file, the script will invoke the execution of the server procedure for obtaining payment from the requesting user.

[0122] In yet another alternate embodiment, a multi-resolution image may be stored in the server as a set of separate base image tiles 190-B, each having the format shown in FIG. 8B. This has the advantage of providing image tiles 190-B that are ready for downloading to client computers without modification.

[0123] Referring to FIG. 8A again, the header 194 of the image tile includes the information needed to access the various base image subfiles 196. In particular, in one embodiment, the header 194 stores:

[0124] an identifier or the URL of the image file in the server;

[0125] a parameter value that indicates the number of base image subfiles 196 in the file (or the number of base image files in embodiments in which each base image is stored in a separate file);

[0126] the size of each base image data structure; and

[0127] a offset pointer to each base image data structure (or a pointer to each base image file in embodiments in which each base image is stored in a separate file).

[0128] Each base image subfile 196 has a header 204 and a sequence of bitstreams 206. The bitstreams are labeled 1 a, 1 b, to N, where N is the number of resolution levels supported by the base image in question. The meaning of the labels “1 a” and the like will be explained below. The information in each bit stream 206 will be described in full detail below. The header data 204 of each base image subfile includes fields that indicate:

[0129] the size of the base image subfile (i.e., the amount of storage occupied by the base image subfile);

[0130] the size of the tiles (e.g., the number of rows and columns of pixels) used to tile the base image, where each tile is separately transformed and encoded, as described below;

[0131] the color channel components stored for this base image subfile;

[0132] the transform filters used to decompose the base image (e.g., different sets of transform filters may be used on different images);

[0133] the number of spacial frequency subbands encoded for the base image (i.e., for each tile of the base image);

[0134] the number of resolution levels (else called subimages) supported by the base image;

[0135] the number of bitstreams encoded for the base image (i.e., for each tile of the base image); and

[0136] information for each of the bitstreams.

[0137] The header information far each bitstream in the base image subfile may include:

[0138] an offset pointer to the bitstream to indicate its position within the image tile (or within the base image subfile);

[0139] the size of bitstream (how much data is in the bitstream);

[0140] the range of spatial frequency subbands included in the bitstream;

[0141] the number of color channels in the bitstream;

[0142] the range of bit planes included in the bitstream, which indicates how the bit planes of the coefficients in the subbands were divided between significant, insignificant and possibly mid-significant portions; and a table of offset pointers to the tiles 208 within the bitstream.

[0143] Each bitstream 206 includes a sequence of tile subarrays 208, each of which captains the i^(th) bitstream for a respective tile of the image. The bitstream 206 may optionally include a header 209 having fields used to override parameters specified for the base image by the base image header 204. When the image file contains a cropped image, the set of tile subarrays 208 included to the image file is limited to those needed to represent the cropped image.

[0144] In one embodiment, the image file header 194 also includes parameters indicating “cropped image boundaries.” This is useful for partial copies of the image file that contain data only for a cropped portion of the image, which in turn is very useful when a client computer is being used to perform pan and zoom operations in an image. For instance, a user may have requested only a very small portion of the overall image, but at very high resolution. In this case, only the tiles of the image needed to display the cropped portion of the image will be included in the version of the image tile sent to the user's client computer, and the cropped image boundary parameters are used to convey this information to the procedures that render the image an the client computer. Two types of image cropping information are provided by the image file header 194: cropping that applies to the entire image file, and any further cropping that applies to specific subimages. For instance, when a client computer first receives an image, it may receive just the lowest resolution level subimage of a particular base image, and that subimage will typically not be cropped (compared to the full image). When the client zooms in on a part of the image at a specified higher resolution level, only the tiles of data needed to generate the portion of the image to be viewed on the client computer are sent to the client computer, and thus new cropping parameters will be added to the header of the image file stored (or cached) in the client computer to indicate the cropping boundaries for the subimage level or levels downloaded to the client computer in response to the client's image zoom command.

[0145] The table of offset pointers to tiles that is included in the base image header for each bitstream in the base image is also used during zooming and panning. In particular, referring to FIG. 18, when an image file is first downloaded by a client computer or device (240), the higher level bitstreams may be unpopulated, and thus the table of offset pointers will initially contain null values. When the user of the client devices zooms in on the image, the data for various tiles of the higher level bitstreams are downloaded to the client device, as needed (242), and the table of offset pointers to tiles is updated to reflect the tiles for which data have been downloaded to the client computer. When the client further pans across the image at the zoomed or higher resolution level, additional tiles of information are sent to the client computer as needed, and the cropping information in the image tile header 194 and the tile offset information in the base image header are again updated to reflect the tiles of data stored for each bitstream (244).

[0146] Referring again to FIGS. 8A-8E, the information in the headers of the image file and the base image subfiles enables quick indexing into any part of the tile, which enables a computer or other device to locate the beginning or end of any portion of the image, at any resolution level, without having to decode the contents of any other portions of the image file 190. This is useful, for example, when truncating the image file 190 so as to generate a lower image quality version of the file, or a cropped image version of the file, such as for transmission over a communications network to another computer or device.

[0147] In some of the discussions that follow, the terms “subimage” and “differential subimage” will be used with respect to the bitstreams 206 as follows. Generally, any subimage of a base image will include all the bitstreams from bitstream 1 a through a particular last bitstream, such as bitstream 3. This group of contiguous bitstreams constitute the data needed to reconstruct the image at a particular resolution level, herein called a subimage. A “differential subimage” consists of the additional bitstreams needed to increase the image resolution from one subimage level to the next. For instance, bitstreams 1 c, 2 b and 3 might together be called a differential subimage because these bitstreams contain the data needed to double the resolution of the subimage generated from bitstreams 1 a through 2 a.

[0148] Referring to FIG. 8C, the encoded data 190-C representing a base image is initially stored in “tile order.” The image file 190-C includes a header 222 and a set of tile subfiles 220. Referring to FIG. 8D, each tile subfile 220 contains a header 224 denoting the quantization table used to encode the tile, offset pointers to the bitstreams within the subfile, and other information. The title subfile 220 for each tile also contains a set of bitstream subarrays 226. Each tile bitstream subarray 226 contains encoded data representing either the most significant bit planes, least significant bit planes or a middle set of bit planes or a respective set of NQS subbands (see FIG. 6B) of the tile. The following table shows an example of bit plan mappings to bitstream subarrays: NQS Subbrand Nos. Resolution 0 to 3 4, 5, 6 7, 8, 9 16 × 16 S 32 × 32 S + MS S 64 × 64 S + MS + IS S + IS All

[0149] In this table, the bit planes corresponding to S, MS and IS differ for each NQS subband. These bit plane ranges are specified in the header of the base image subfile. For instance, for NQS subbands 0 to 3, S may corresponding to bit planes 16 to 7, MS may correspond to bit planes 6 to 4, and IS may correspond to bit planes 3 to 0, while for NQS subbands 4 to 6, S may corresponding to bit planes 16 to 5, and IS may correspond to bit planes 4 to O.

[0150] Bitstreams 1 a, 1 b and 1 c contain the encoded data representing the most significant, middle and least significant bit planes of NQS subbands 0, 1, 2 and 3, respectively. Bitstreams 2 a and 2 b contain the encoded data representing the most significant and least significant bit planes, respectively, of NQS subbands 4, 5 and 6, which correspond to the LH₂, HL₂ and HH₂ subbands. Bitstream 3 contains all the bit planes of the encoded data representing NQS subbands 7, 8 and 9, which correspond to the LH₁, HL₁ and HH₁ subbands, respectively.

[0151] The tile subfiles 220 may be considered to be “temporary” files, because the encoded tile data is later reorganized from the file format of FIGS. 8C and 8D into the file format shown in FIG. 8A.

[0152]FIG. 8E shows a specific example of a base image subfile 196, labeled 196A. The base image subfile contains twelve bitstreams 206, which are used to generate the base image and two lower resolution subimages. The base image has been transformed with five layers of wavelet transforms, providing sixteen spatial frequency subbands of data, which have been encoded and organized into three subimages, including the base image. The number of subimages is somewhat arbitrary, since the subbands generated by five transform layers could be used to generate as many as six subimages. However, using this base image subfile to generate very small subimages is not efficient in terms of memory or storage utilization, and therefore it will be preferred to use a smaller base image subfile to generate smaller subimages.

[0153] In FIG. 8E, the base image has been processed by five transform layers, but the resulting data has been organized into just three subimage levels instead of six. Effectively, the last three transform layers, which convert subband LL₂ into ten subbands (LL₅, LH₅, HL₅, HH₅, LH₄, HL₄, HH₄, LH₃ and HH₃), are not used to generate an extra subimage level. Rather, the last three transform layers are used only to produce better data compression.

[0154] As shown in FIG. 8E, when the five transform layers of image data are mapped to three subimages, the mapping of bitstream data subarrays 206 to subimages is as follows:

[0155] subimage 0, the lowest level subimage, corresponds to bitstream subarray 206-1 a, which contains the most significant bit planes of NQS subbands 0 to 3 (see FIG. 6B);

[0156] subimage 1 corresponds to bitstreams 206-1 a, 206-1 b and 206-2 a; and

[0157] subimage 2, the base image, corresponds to all the bitstreams 206 in the base image subfile.

[0158] When the transform layers are mapped to more subimages (subimage levels) than in the example shown in FIG. 8E, the first bitstream 206-1 a will include fewer of the spatial frequency subbands.

[0159] A sparse data encoding technique is used to encode the transform coefficients for each group of subbands of each tile so that it takes very little data to represent arrays of data that contain mostly zero values. Typically, higher frequency portions (i.e., subbands) of the transformed, quantized image data will contain more zero values than non-zero values, and further most of the non-zero values will have relatively small absolute value. Therefore, the higher level bit planes of many tiles will be populated with very few non-zero bit values.

[0160] Tiled Wavelet Transform Method

[0161] Referring to FIG. 9, the process for generating an image file begins when an image is captured by the image capture device (step 250). If the image size is variable, the size of the captured image is determined and the number of rows and columns of tiles needed to cover the image data is determined (step 252). If the image size is always the same, step 252 is not needed.

[0162] Next, all the tiles in the image are processed in a predetermined order for example in raster scan order, by applying a wavelet-like decomposition transform to them in both the horizontal and vertical directions, then quantizing the resulting transform coefficients, and finally by encoding the quantized transform coefficients using a sparse data compression and encoding procedure (step 254). The encoded data for each tile is stored in a temporary file or subfile, such as in the format shown in FIG. 8D.

[0163] After all the tiles in the image have been processed, a multi-resolution image file containing all the encoded tiles is stored in non-volatile memory (step 256). More specifically, the encoded tile data from the temporary files is written into an output bitstream file in resolution reversed order, in the file format shown in FIG. 8A. “Resolution reversed order” means that the image data is stored in the file with the lowest resolution bitstream first, followed by the next lowest resolution bitstream, and so on.

[0164] The wavelet-like decomposition transform used in step 254 is described in more detail below, with reference to FIGS. 10A, 10B and 10C. The quantization and sparse data encoding steps are also described in detail below.

[0165] After the initial image has been processed, encoded and stored as a multi-resolution image file, typically containing two to four resolution levels, if more than one base image is to be included in the image file (257), the original image is down-sampled and anti-aliased so as to generate a new base image (258) that is smaller in each dimension by a factor of 2^(X), where X is the number of subimage levels in the previously generated multi-resolution image file. Thus, the new base image will be a factor of 4 smaller than the smallest lowest-resolution subimage of the base image. The new base image is then processed in the same way as the previous base image so as to generate an additional, but much smaller, encoded multi-resolution base image that is added to the image file. If the original base image had sufficiently high resolution, a third base image may be formed by performing a second round of down-sampling and anti-aliasing, and a third encoded multi-resolution base image file may be stored in the image file. The last encoded base image may contain fewer subimage levels than the others, and in some embodiments may contain only a single resolution level, in which case that image file is effectively a thumbnail image file.

[0166] In an alternate embodiment, each encoded base image is stored in a separate image file, and these image files are linked to each other either by information stored in the headers of the image files, or by html (or html-like) links.

[0167] In one embodiment, the down-sampling filter is a one-dimensional FIR filter that is applied first to the rows of the image and then to the columns, or vice versa. For example, if the image is to be down-sampled by a factor of 4 in each dimension (for a factor of 16 reduction in resolution), the FIR filter may have the following filter coefficients:

Filter A=(−3 −4 −4 10 10 29 29 29 29 10 10 −4 −4 −3 −3)1/128.

[0168] This exemplary filter is applied to a set of 14 samples at a time to produce one down-sampled value, and is then shifted by four samples and is then applied again. This repeats until L/4 down-sampled values have been generated, where L is the number of initial samples (i.e., pixel values). At the edges of the image data array, reflected data is used for the filter coefficients that extend past the edge of the image data. For instance, at the left (or top) edge of the array, the first six coefficients are applied to reflected data values, tile four “29/128”, coefficients are applied to the first four pixel values in the row (or column) being filtered, and the last six coefficients are applied to the next six pixels in the row (or column).

[0169] If an image is to be down-sampled by a factor of 8, the above described filter is applied to down-sample by a factor of 4, and then a second filter is applied to further down-sample the image data by another factor of 2. This second filter, in one embodiment, is a FIR filter that has the following filter coefficients:

Filter B=(−3 −4 10 29 29 10 −4 −3)1/64.

[0170] Alternately, a longer filter could be used to achieve the down-sampling by a factor of 8 in one filter pass.

[0171] The down-sampling filters described above have the following properties: they are low-pass filters with cut-off frequencies at one quarter and one half the Nyquist frequency, respectively; each filter coefficient is defined by a simple fraction in which the numerator is an integer and the denominator is a positive integer power of 2 (i.e., a number of the form 2^(N), where N is a positive integer). As a result of these filter properties, the down-sampling can be performed very efficiently while preserving the spatial frequency characteristics of the image and avoiding aliasing effects.

[0172] While the order in which the down-sampling filter(s) are applied to an array of image data (i.e., rows and then columns, or vice versa) will affect the specific down-sampled pixel values generated, the effect on the pixel values is not significant. Other down-sampling filters may be used in alternate embodiments.

[0173] Wavelet-Like Decomposition Using Edge, Interior and Center Transform Filters

[0174] FIGS. 10A-10C schematically represent the process of performing a wavelet-like decomposition on a set of image data X₀ to X_(2n−1) to generate a set of coefficients L₀ to L_(n−1) and H₀ to H_(n−1) where the L coefficients represent the low spatial frequency components of the image data and the H coefficients represent the high spatial frequency components of the image data.

[0175] In one embodiment, the wavelet-like transform that is applied is actually two filters. A first filter, T1, called the edge filter, is used to generate the first two and last two coefficients in the row or column of transform coefficients that are being generated, and a second filter T2, called the interior filter, is used to generate all the other coefficients in the row or column of transform coefficients being generated. The edge filter, T1 is a short filter that is used to transform data at the edges of a tile or block, while the interior filter T2 is a longer filter that is used to transform the data away from the edges of the tile or block. Neither the edge filter nor the interior filter uses data from outside the tile or block. As a result, the working memory required to apply the wavelet-like transform described herein to an array of image data is reduced compared to prior art systems. Similarly, the complexity of the circuitry and/or software for implementing the wavelet-like transform described herein is reduced compared to prior art systems.

[0176] In one embodiment, the edge filter includes a first, very short filter (whose “support” covers two to four data values) for generating the first and last coefficients, and a second filter for generating the second and second to last coefficients. The second edge filter has a filter support that extends over three to six data values, and thus is somewhat longer than the first edge filter but shorter than the interior filter T2. The interior filter for generating the other coeffcients typically has a filter support of seven or more data values. The edge filter, especially the first edge filter for generating the first and last high spatial frequency coefficient values, is designed to reduce, or possibly even minimize, edge artifacts while not using any data from neighboring tiles or blocks, at a cost of decreased data compression. Stated in another way, the edge filter of the present invention is designed to ensure accurate reproduction of the edge values of the data array being processed, which in turn reduces, and possibly minimizes, edge artifacts when the image represented by the data array is regenerated.

[0177] In one embodiment, the wavelet-like decomposition transform applied to a data array includes a layer 1 wavelet-like transform that is distinct from the wavelet-like transform used when performing layers 2 to N of the transform. In particular, the layer 1 wavelet-like transform uses shorter filters, having shorter filter supports, than the filters used for layers 2 to N. One of the reasons for using a different wavelet-like transform (i.e., a set of transform filters) for layer 1 than for the other layers is to reduce or minimize rounding errors introduced by the addition of a large number of scaled values. Rounding errors, which occur primarily when filtering the raw image data during the layer 1 transform can sometimes cause noticeable degradation in the quality of the image regenerated from the encoded image data.

[0178] The equations for the wavelet-like decomposition transform used in the preferred embodiment are presented below.

Layer 1 Forward Wavelet-Like Transform

[0179] T1 and T2 Forward Transforms (Low Frequency)

Y _(k) =X _(2k) −X _(2k+1) k=0, 1, . . . , n−1

[0180] ${L_{k} = {{X_{{2k} + 1} + \left\lbrack \frac{Y_{k} + 1}{2} \right\rbrack} = {{\frac{X_{2k} + X_{{2k} + 1} + 1}{2}\quad k} = 0}}},1,\ldots,{n - 1}$

[0181] T1 Forward Transform (Edge Filter—High Frequency) $H_{0} = {Y_{0} + \left\lbrack \frac{{- L_{0}} + L_{1} + 1}{2} \right\rbrack}$ $H_{1} = {Y_{1} + \left\lbrack \frac{{- L_{0}} + L_{2} + 2}{4} \right\rbrack}$ $H_{n - 2} = {Y_{n - 2} + \left\lbrack \frac{{- L_{n - 3}} + L_{n - 1} + 2}{4} \right\rbrack}$ $H_{n - 1} = {Y_{n - 1} + \left\lbrack \frac{{- L_{n - 2}} + L_{n - 1} + 1}{2} \right\rbrack}$

[0182] T2 Forward Transform (Interior Filter—High Frequency) $H_{k} = {Y_{k} + \left\lbrack \frac{{3L_{k - 2}} - {22L_{k - 1}} + {22L_{k + 1}} - {3L_{k + 2}} + 32}{64} \right\rbrack}$ k = 2, …  , n − 3

Layer 1 Inverse Wavelet-Like Transform

[0183] T1 Inverse Transform (Edge Filter—High Frequency) $Y_{0} = {H_{0} - \left\lbrack \frac{{- L_{0}} + L_{1} + 1}{2} \right\rbrack}$ $Y_{1} = {H_{1} - \left\lbrack \frac{{- L_{0}} + L_{2} + 2}{4} \right\rbrack}$ $Y_{n - 2} = {H_{n - 2} - \left\lbrack \frac{{- L_{n - 3}} + L_{n - 1} + 2}{4} \right\rbrack}$ $Y_{n - 1} = {H_{n - 1} - \left\lbrack \frac{{- L_{n - 2}} + L_{n - 1} + 1}{2} \right\rbrack}$

[0184] T2 Inverse Transform (Interior Filter) ${Y_{k} = {{H_{k} - {\left\lbrack \frac{{3L_{k - 2}} - {22L_{k - 1}} + {22L_{k + 1}} - {3L_{k + 2}} + 32}{64} \right\rbrack \quad k}} = 2}},\ldots \quad,{n - 3}$ ${X_{{2k} + 1} = {{L_{k} - {\left\lbrack \frac{Y_{k} + 1}{2} \right\rbrack \quad k}} = 0}},1,\ldots \quad,{n - 1}$ X_(2k) = Y_(k) + X_(2k + 1)  k = 0, 1, …  , n − 1

Forward Wavelet-Like Transform: Layers 2 to N

[0185] The equations for one embodiment of the forward wavelet-like decomposition transform for transform levels 2 through N (i.e., all except level 1) are shown next. Note that “2n” denotes the width of the data, as measured in data samples, that is being processed by the transform; “n” is assumed to be a positive integer. The edge filter T1 is represented by the equations for H₀, H_(n−1), L₀, and L_(n−1), and has a shorter filter support than the interior filter T2.

[0186] In alternative embodiment, the same wavelet-like decomposition transforms are used for all layers. For example, the wavelet-like decomposition transform filters shown here are layers 2 to N would also be used for the layer 1 decomposition (i.e., for filtering the raw image data). $H_{0} = {X_{1} - {\left\lbrack \frac{X_{0} + X_{2} + 1}{2} \right\rbrack \quad \left( {\text{edge}\quad {filter}} \right)}}$ ${H_{k} = {{X_{{2k} + 1} - {\left\lbrack \frac{{9\left( {X_{2k} + X_{{2k} + 2}} \right)} - X_{{2k} - 2} - X_{{2k} + 4} + 8}{16} \right\rbrack \quad k}} = 1}},\ldots \quad,{\frac{n}{2} - 3}$ $H_{\frac{n}{2} - 2} = {X_{n - 3} - {\left\lbrack \frac{X_{n - 4} + X_{n - 2} + 1}{2} \right\rbrack \quad \left( {{center}\quad {filter}} \right)}}$ $H_{\frac{n}{2} - 1} = {X_{n - 1} - {\left\lbrack \frac{{11X_{n - 2}} + {5X_{n + 1}} + 8}{16} \right\rbrack \quad \left( {{center}\quad {filter}} \right)}}$ $H_{\frac{n}{2}} = {X_{n} - {\left\lbrack \frac{{5X_{n - 2}} + {11X_{n + 1}} + 8}{16} \right\rbrack \quad \left( {{center}\quad {filter}} \right)}}$ $H_{\frac{n}{2} + 1} = {X_{n + 2} - {\left\lbrack \frac{X_{n + 1} + X_{n + 3} + 1}{2} \right\rbrack \quad \left( {{center}\quad {filter}} \right)}}$ ${H_{k} = {X_{2k} - \left\lbrack \frac{{9\left( {X_{{2k} - 1} + X_{{2k} + 1}} \right)} - X_{{2k} - 3} - X_{{2k} + 3} + 8}{16} \right\rbrack}}\quad$ ${k = {\frac{n}{2} + 2}},\ldots \quad,{n - 2}$ $H_{n - 1} = {X_{{2n} - 2} - {\left\lbrack \frac{X_{{2n} - 3} + X_{{2n} - 1} + 1}{2} \right\rbrack \quad \left( {{edge}\quad {filter}} \right)}}$ $L_{0} = {{X_{0} + \left\lbrack \frac{H_{0} + 2}{4} \right\rbrack} = {\frac{{7X_{0}} + {2X_{1}} - X_{2} + 3}{8}\quad \left( {{edge}\quad {filter}} \right)}}$ $L_{1} = {X_{2} + {\left\lbrack \frac{H_{0} + H_{1} + 2}{4} \right\rbrack \quad \left( {{edge}\quad {filter}} \right)}}$ ${L_{k} = {X - {2k} + \left\lbrack \frac{{5\left( {H_{k - 1} + H_{k}} \right)} - H_{k - 2} - H_{k + 1} + 8}{16} \right\rbrack}}\quad$ ${k = 1},\ldots \quad,{\frac{n}{2} - 3}$ $L_{\frac{n}{2} - 2} = {X_{n - 4} + {\left\lbrack \frac{H_{\frac{n}{2} - 3} + H_{\frac{n}{2} - 2} + 2}{4} \right\rbrack \quad \left( {{center}\quad {filter}} \right)}}$ $L_{\frac{n}{2} - 1} = {X_{n - 2} + {\left\lbrack \frac{H_{\frac{n}{2} - 2} + {2H_{\frac{n}{2} - 1}} - H_{\frac{n}{2}} + 4}{8} \right\rbrack \quad \left( {{center}\quad {filter}} \right)}}$ $L_{\frac{n}{2}} = {X_{n - 1} + {\left\lbrack \frac{{2H_{\frac{n}{2} + 1}} + {2H_{\frac{n}{2}}} - H_{\frac{n}{2} - 1} + 4}{8} \right\rbrack \quad \left( {{center}\quad {filter}} \right)}}$ $L_{\frac{n}{2} + 1} = {X_{n + 3} + {\left\lbrack \frac{H_{\frac{n}{2} + 1} + H_{\frac{n}{2} + 2} + 2}{4} \right\rbrack \quad \left( {{center}\quad {filter}} \right)}}$ ${L_{k} = {{X_{2k} + {{1\left\lbrack \frac{{5\left( {H_{k} + H_{k + 1}} \right)} - H_{k - 1} - H_{k + 2} + 8}{16} \right\rbrack}\quad k}} = {\frac{n}{2} + 2}}},\ldots \quad,{n - 3}$ $L_{n - 2} = {X_{{2n} - 3} + \left\lbrack \frac{H_{n - 2} + H_{n - 1} + 2}{4} \right\rbrack}$ $L_{n - 1} = {{X_{{2n} - 1} + \left\lbrack \frac{H_{n - 1} + 2}{4} \right\rbrack} = {\frac{{7X_{{2n} - 1}} + {2X_{{2n} - 2}} - X_{{2n} - 3} + 3}{8}\quad \left( {{edge}\quad {filter}} \right)}}$

[0187] The general form of the decomposition transform equations, shown above, applies only when n is at least ten. When n is less than ten, some of the equations for terms between the edge and middle terms are dropped because the number of coefficients to be generated is too few to require use of those equations. For instance, when n=8, the two equations for generating L_(k) will be skipped.

[0188] Discussion of Attributes of Transform Filter

[0189] It is noted that the edge transform filter T1 for generating L₀ and L_(n−1) has a filter support of just three input samples at the edge of the input data array, and is weighted so that 70% of the value of these coefficients is attributable to the edge value X₀ and X_(2n−1) at the very boundary of the aray of data being filtered. The heavy weighting of the edge input datum (i.e., the sample closest to the array boundary) enables the image to be reconstructed from the transform coefficients substantially without the boundary artifacts, despite the fact that the edge and interior filters are applied only to data within the tile when generating the transform coefficients for the tile. The layer 1 edge transform filter T1 for generating L₀ and L_(n−1) is weighted so that 50% of the value of these coefficients is attributable to the edge value X_(2n−1) at the very boundary of the data array being filtered.

[0190] The interior transform filters in one embodiment are not applied in a uniform manner across the interior of the data array being filtered. Furthermore, the interior filter includes a center filter for generating four high pass and four low pass coefficients at or near the center of the data array being filtered. In alternative embodiments, the center filter may generate as few as two high pass and two low pass coefficients. The center filter is used to transition between the left and right (or upper and lower) portions of the interior filter. The transition between the two forms of the interior filter is herein called “filter switching.” One half of the interior filter, excluding the center filter, is centered on even numbered data or coefficient positions while the other half of the interior filter is centered on data at odd data positions. (The even and odd data positions of the array are, of course, alternating data positions.) While the equations as written place the center filter at the middle of the array, the center filter can be positioned anywhere within the interior of the data array, so long as there is a smooth transition between the edge filter and the interior filter. Of course, the inverse transform filter must be defined so as to have an inverse center filter at the same position as the forward transform filter.

[0191] Transform Equations for Small data Arrays, for Layers 2 to N

[0192] When n is equal to four, the transform to be performed can be represented as:

(X₀ , X ₁ , X ₂ , X ₃ , X ₄ , X ₅ , X ₆ , X ₇)→(L₀ , L ₁ , L ₂ , L ₃ ; H ₀ , H ₁ , H ₂ , H ₃)

[0193] and the above general set of transform equations is reduced to the following: $H_{0} = {X_{1} - \left\lbrack \frac{X_{0} + X_{2} + 1}{2} \right\rbrack}$ $H_{1} = {X_{3} - \left\lbrack \frac{{11X_{2}} + {5X_{5}} + 8}{16} \right\rbrack}$ $H_{2} = {X_{4} - \left\lbrack \frac{{5X_{2}} + {11X_{5}} + 8}{16} \right\rbrack}$ $H_{3} = {X_{6} - \left\lbrack \frac{X_{5} + X_{7} + 1}{2} \right\rbrack}$ $L_{0} = {X_{0} + \left\lbrack \frac{H_{0} + 2}{4} \right\rbrack}$ $L_{1} = {X_{2} + \left\lbrack \frac{{2H_{0}} + {2H_{1}} - H_{2} + 4}{8} \right\rbrack}$ $L_{2} = {X_{5} + \left\lbrack \frac{{2H_{3}} + {2H_{2}} - H_{1} + 4}{8} \right\rbrack}$ $L_{3} = {X_{7} + \left\lbrack \frac{H_{3} + 2}{4} \right\rbrack}$

[0194] When n is equal to two, the transform can be represented as:

(X ₀ , X ₁ , X ₂ , X ₃)→(L ₀ , L ₁ ; H ₀ , H ₁)

[0195] and the above general set of transform equations is reduced to the following: $H_{0} = {X_{1} - \left\lbrack \frac{X_{0} + X_{3} + 1}{2} \right\rbrack}$ $H_{1} = {X_{2} - \left\lbrack \frac{X_{0} + X_{3} + 1}{2} \right\rbrack}$ $L_{0} = {X_{0} + \left\lbrack \frac{H_{0} + 2}{4} \right\rbrack}$ $L_{1} = {X_{3} + \left\lbrack \frac{H_{0} + 2}{4} \right\rbrack}$

[0196] Inverse Wavelet-Like Transform: Layers 2 to N

[0197] The inverse wavelet-like transform for transform layers 2 through N (i.e., all except layer 1), used in one embodiment, are shown next.

[0198] The general form of the transform equations applied only when n is at least ten. When n is less than ten, some of the equations for terms between the edge and middle terms are dropped because the number of coefficients to be generated is too few to require use of those equations. $X_{0} = {L_{0} - \left\lbrack \frac{H_{0\quad} + 2}{4} \right\rbrack}$ $X_{2} = {L_{1} - \left\lbrack \frac{H_{0} + H_{1} + 2}{4} \right\rbrack}$ ${X_{2k} = {{L_{k} - {\left\lbrack \frac{{5\left( {H_{k - 1} + H_{k}} \right)} - H_{k - 2} - H_{k - 1} + 8}{16} \right\rbrack \quad k}} = 2}},\ldots \quad,{\frac{n}{2} - 3}$ $X_{n - 4} = {L_{\frac{n}{2} - 2} - \left\lbrack \frac{H_{\frac{n}{2} - 3} + H_{\frac{n}{2} - 2} + 2}{4} \right\rbrack}$ $X_{{2k} - 1} = {L_{k} - \left\lbrack \frac{{5\left( {H_{k} + H_{k + 1}} \right)} - H_{k - 1} - H_{k + 2} + 8}{16} \right\rbrack}$ ${k = {\frac{n}{2} + 2}},\ldots \quad,{n - 3}$ $X_{n - 2} = {L_{\frac{n}{2} - 1} - \left\lbrack \frac{{2H_{\frac{n}{2} - 2}} + {2H_{\frac{n}{2} - 1}} - H_{\frac{n}{2}} + 4}{8} \right\rbrack}$ $X_{n + 1} = {L_{\frac{n}{2}} - \left\lbrack \frac{{2H_{\frac{n}{2} + 1}} + {2H_{\frac{n}{2}}} - H_{\frac{n}{2} - 1} + 4}{8} \right\rbrack}$ $X_{n + 3} = {L_{\frac{n}{2} + 1} - \left\lbrack \frac{H_{\frac{n}{2} + 1} + H_{\frac{n}{2} + 2} + 2}{4} \right\rbrack}$ $X_{{2n} - 3} = {L_{n - 2} - \left\lbrack \frac{H_{n - 2} + H_{n - 1} + 2}{4} \right\rbrack}$ $X_{{2n} - 1} = {L_{n - 1} - \left\lbrack \frac{H_{n - 1} + 2}{4} \right\rbrack}$ $X_{1} = {H_{0} - \left\lbrack \frac{X_{0} + X_{2} + 1}{2} \right\rbrack}$ $X_{{2k} + 1} = {H_{k} + \left\lbrack \frac{{9\left( {X_{2k} + X_{{2k} + 2}} \right)} - X_{{2k} - 2} - X_{{2k} + 4} + 8}{16} \right\rbrack}$ ${k = 1},\ldots \quad,{\frac{n}{2} - 3}$ $X_{n - 3} = {H_{\frac{n}{2} - 2} + \left\lbrack \frac{X_{n - 4} + X_{n - 2} + 1}{2} \right\rbrack}$ $X_{n - 1} = {H_{\frac{n}{2} - 1} + \left\lbrack \frac{{11X_{n - 2}} + {5X_{n - 1}} + 8}{16} \right\rbrack}$ $X_{n} = {H_{\frac{n}{2}} + \left\lbrack \frac{{5X_{n - 2}} + {11X_{n - 1}} + 8}{16} \right\rbrack}$ $X_{n + 2} = {H_{\frac{n}{2} + 1} + \left\lbrack \frac{X_{n + 1} + X_{n + 3} + 1}{2} \right\rbrack}$ $X_{2k} = {H_{k} + \left\lbrack \frac{{9\left( {X_{{2k} - 1} + X_{{2k} + 1}} \right)} - X_{{2k} - 3} - X_{{2k} + 3} + 8}{16} \right\rbrack}$ ${k = {\frac{n}{2} + 2}},\ldots \quad,{n - 2}$ $X_{{2n} - 2} = {H_{n - 1} + \left\lbrack \frac{X_{{2n} - 3} + X_{{2n} - 1} + 1}{2} \right\rbrack}$

[0199] When n is equal to eight, the above general set of inverse transform equations is reduced to the following: $X_{0} = {L_{0} - \left\lbrack \frac{H_{0} + 2}{4} \right\rbrack}$ $X_{2} = {L_{1} - \left\lbrack \frac{H_{0} + H_{1} + 2}{4} \right\rbrack}$ $X_{4} = {L_{2} - \left\lbrack \frac{H_{1} + H_{2} + 2}{4} \right\rbrack}$ $X_{6} = {L_{3} - \left\lbrack \frac{{2H_{2}} + {2H_{3}} - H_{4} + 4}{8} \right\rbrack}$ $X_{9} = {L_{4} - \left\lbrack \frac{{2H_{5}} + {2H_{4}} - H_{3} + 4}{8} \right\rbrack}$ $X_{11} = {L_{5} - \left\lbrack \frac{H_{6} + H_{6} + 2}{4} \right\rbrack}$ $X_{13} = {L_{6} - \left\lbrack \frac{H_{6} + H_{7} + 2}{4} \right\rbrack}$ $X_{15} = {L_{7} - \left\lbrack \frac{H_{7} + 2}{4} \right\rbrack}$ $X_{1} = {H_{0} + \left\lbrack \frac{X_{0} + X_{2} + 1}{2} \right\rbrack}$ $X_{3} = {H_{1} + \left\lbrack \frac{{9\left( {X_{2} + X_{4}} \right)} - X_{0} - X_{6} + 8}{16} \right\rbrack}$ $X_{5} = {H_{2} + \left\lbrack \frac{X_{4} + X_{6} + 1}{2} \right\rbrack}$ $X_{7} = {H_{3} + \left\lbrack \frac{{11X_{6}} + {5X_{9}} + 8}{16} \right\rbrack}$ $X_{8} = {H_{4} + \left\lbrack \frac{{5X_{6}} + {11X_{9}} + 8}{16} \right\rbrack}$ $X_{10} = {H_{5} + \left\lbrack \frac{X_{9} + X_{11} + 1}{2} \right\rbrack}$ $X_{12} = {H_{6} + \left\lbrack \frac{{9\left( {X_{11} + X_{13}} \right)} - X_{9} - X_{15} + 8}{16} \right\rbrack}$ $X_{14} = {H_{7} + \left\lbrack \frac{X_{13} + X_{15} + 1}{2} \right\rbrack}$

[0200] When n is equal to four, the inverse transform to be performed can be represented as:

(L ₀ , L ₁ , L ₂ , L ₃ ; H ₀ , H ₁ , H ₂ , H ₃)→(X ₀ , X ₁ , X ₂ , X ₃ , X ₄ , X ₅ , X ₆ , X ₇)

[0201] and the above general set of inverse transform equations is reduced to the following: $\begin{matrix} {X_{0} = {L_{0} - \left\lbrack \frac{H_{0} + 2}{4} \right\rbrack}} \\ {X_{2} = {L_{1} - \left\lbrack \frac{{2H_{0}} + {2H_{1}} - H_{2} + 4}{8} \right\rbrack}} \\ {X_{5} = {L_{2} - \left\lbrack \frac{{2H_{3}} + {2H_{2}} - H_{1} + 4}{8} \right\rbrack}} \\ {X_{7} = {L_{3} - \left\lbrack \frac{H_{3} + 2}{4} \right\rbrack}} \\ {X_{1} = {H_{0} + \left\lbrack \frac{X_{0} + X_{2} + 1}{2} \right\rbrack}} \\ {X_{3} = {H_{1} + \left\lbrack \frac{{11X_{2}} + {5X_{5}} + 8}{16} \right\rbrack}} \\ {X_{4} = {H_{2} + \left\lbrack \frac{{5X_{2}} + {11X_{5}} + 8}{16} \right\rbrack}} \\ {X_{6} = {H_{3} + \left\lbrack \frac{X_{5} + X_{7} + 1}{2} \right\rbrack}} \end{matrix}$

[0202] When n is equal to two, the inverse transform to be performed can be represented as:

(L ₀ , L ₁ ; H ₀ , H ₁)→(X ₀ , X ₁ , X ₂ , X ₃ , X ₄)

[0203] and the above general set of inverse transform equations is reduced to the following: $\begin{matrix} {X_{0} = {L_{0} - \left\lbrack \frac{H_{0} + 2}{4} \right\rbrack}} \\ {X_{3} = {L_{1} - \left\lbrack \frac{H_{1} + 2}{4} \right\rbrack}} \\ {X_{1} = {H_{0} + \left\lbrack \frac{X_{0} + X_{3} + 1}{2} \right\rbrack}} \\ {X_{2} = {H_{1} + \left\lbrack \frac{X_{0} + X_{3} + 1}{2} \right\rbrack}} \end{matrix}$

[0204] In one embodiment, during each layer of the inverse transform process the coefficients at the even positions (i.e., the X_(2i) values) must be computed before the coefficients at the odd positions (i.e., the X_(2i+1) values).

[0205] In an alternate embodiment, the short T1 decomposition transform is used to filter all data, not just the data at the edges. Using only short T1 decomposition transform reduces computation time and complexity, but decreases the data compression achieved and thus results in larger image files. Using only short transform also reduces the computation time to decode an image file that contains an image encoded using the present invention, because only the corresponding short T1 reconstruction transform is used during image reconstruction.

[0206] Adaptive Blockwise Quantization

[0207] Referring to FIG. 6, each wavelet coefficient produced by the wavelet-like decomposition transform is quantized: ${\hat{x}}_{q} = {{{sign}(x)}\left\lbrack \left( {\frac{x}{q} + \frac{3}{8}} \right) \right\rbrack}$

[0208] where q is the quantization divisor, and is dequantized:

{circumflex over (x)}=q{circumflex over (x)}_(q).

[0209] In one embodiment, a quantization table is used to assign each subband of the wavelet coefficients a quantization divisor, and thus controls the compression quality. If five layers of wavelet transforms are performed for luminance values (and four layers for the chrominance values), there are 16 subbands in the decomposition for the luminance values:

[0210] LL₅, HL₅, LH₅, HH₅, HL₄, LH₄, HH₄, HL₃, LH₃, HH₃, HL₂, LH₂, HH₂, HL₁, LH₁, HH₁

[0211] and 13 subbands for the chrominance values:

[0212] LL₄, HL₄, LH₄, HH₄, HL₃, LH₃, HH₃, HL₂, LH₂, HH₂, HL₁, LH₁, HH₁

[0213] One possible quantization table for luminance values is:

[0214] q=(16, 16, 16, 18, 18, 18, 24, 24, 24, 36, 46, 46, 93, 300, 300, 600)

[0215] and for the chrominance values:

[0216] q=(32, 50, 50, 100, 100, 100, 180, 200, 200, 400, 720, 720, 1440).

[0217] However, in one embodiment, the quantization factor q is chosen adaptively for each distinct tile of the image, based on the density of image features in the tile. Referring to FIG. 4, the entries of subbands are labeled LH_(k), HL_(k) and HH_(k) as u_(ij) ^((k)), v_(ij) ^((k)) and w_(ij) ^((k)), respectively.

[0218] Referring to FIG. 12, the block classifier module computes for each transform layer (e.g., k=1, 2, 3, 4, 5) of the tile a set of block classification values, as follows: $U_{k} = {\sum\limits_{ij}\quad {u_{ij}^{(k)}}}$ $V_{k} = {\sum\limits_{ij}\quad {v_{ij}^{(k)}}}$ $W_{k} = {\frac{1}{2}{\sum\limits_{ij}\quad {w_{ij}^{(k)}}}}$ B_(k) = max {U_(k), V_(k), W_(k)} $S_{k} = \sqrt{\frac{1}{2}\left\{ {U_{k}^{2} + V_{k}^{2} + W_{k}^{2} - {\frac{1}{3}\left( {U_{k} + V_{k} + W_{k}} \right)}} \right\}}$

[0219] Vertical and horizontal lines in the original image will mostly be represented by u_(ij) ^((k)) and v_(ij) ^((k)), respectively. B_(k) tends to be large if the original image (i.e., in the tile being evaluated by the block classifier) contains many features (e.g., edges and textures). Therefore, the larger the value of B_(k), the harder it will be to compress the image without creating compression artifacts.

[0220] Using a two-class model, two quantization tables are provided:

[0221] Q0=(16, 16, 16, 18, 18, 18, 36, 36, 36, 72, 72, 72 144. 300, 300, 600),

[0222] Qr−(16, 32, 32, 36, 36, 36, 72, 72, 72, 144, 144, 144, 288, 660, 600, 1200)

[0223] where Q₀ is used for “hard” to compress blocks and Q₁ is used for “easy” to compress blocks.

[0224] Interior tiles (i.e., tiles not on the boundary of the image) are each classified as either “hard” or “easy” to compress based on a comparison of one or more of the B_(k) values with one or more respective threshold values. For instance, as shown in FIG. 12, B₁ for a tile may be compared with a first threshold TH1 (e.g., 65) (step 271). If B₁ is greater than the threshold, then the tile is classified as “hard” (step 272). Otherwise, B₅ is compared with a second threshold TH2 (e.g., 60) (step 273). If B₅ is greater than the second threshold, then the tile is classified as “hard” (step 274), and otherwise it is classified as “easy” (step 275). The wavelet coefficients for the tile are then quantized using the quantization divisors specified by the quantization table corresponding to the block (i.e., tile) classification.

[0225] In one embodiment, boundary tiles are classified by comparing B₁ with another, high threshold value TH1B, such as 85. Boundary tiles with a B₁ value above this threshold are classified as “hard” to compress and otherwise are classified as “easy” to compress.

[0226] In an alternate embodiment, three or more block classifications may be designated, and a corresponding set of threshold values may be defined. Based on comparison of B₁, and/or other ones of the B₁ values with these thresholds, a tile is classified into one of the designated classifications, and a corresponding quantization table is then selected so as to determine the quantization values to be applied to the subbands within the tile. S_(k) also tends to be large if the original image contains many features, and therefore in some embodiments k is used instead of B_(k) to classify image tiles.

[0227] Sparse Data Encoding with Division between Significant and Insignificant Portions

[0228] Referring to FIGS. 13A and 13B, once the transform coefficients for a tile of base image have been generated and quantized, the next step is to encode the resulting coefficients of the tile. A group of computational steps 280 are repeated for each NQS subband. The bitstreams generated by encoding each NQS subband are divided by bit planes and then grouped together to form the bitstreams stored in the image FIGS. 8A to 8E.

[0229] Referring to FIG. 13A, the encoding procedure or apparatus determines the maximum bit depth of the block of data in the NQS subband to be encoded (286), which is the maximum number of bits required to encode any of the coefficient values in the block, and is herein called the maximum bit depth, or MaxbitDepth. The value of MaxbitDepth is determined by computing the maximum number of bits required to encode the absolute value of any data value in the block. In particular, MaxbitDepth is equal to int(log2V)+1, where V is the largest absolute value of any element in the block, and “int()” represents the integer portion of a specified value. The maximum bit depth for each top level block is stored in a corresponding bitstream (e.g., the significant bitstream for the subband group whose coefficients are being encoded). Next, the Block procedure is invoked for the current block (288). A pseudocode representation of the block procedure is shown in Table 2.

[0230] Each block contains four subblocks (see FIG. 14A). As shown in FIG. 13B, the Block procedure determines the MaxbitDepth for each of the four subblocks of the current block (300). Then, it generates and encodes a MaxbitDepth mask (301). The mask has four bits: m₁, m₂, m₃ and m₄, each of which is set equal to a predefined value (e.g., 1) only if the MaxbitDepth of the corresponding subblock is equal to the MaxbitDepth m₀ of the current (parent) block, and is otherwise set to zero. The mathematical representation of the mask is as follows:

[0231] mask=(m₀==m₁)+(m₀==m₂)+(m₀==m₃)+(m₀==m₄)

[0232] where the “+” in the above equation represents concatenation.

[0233] For example, a mask of 1000 indicates that only subblock 1 has a MaxbitDepth equal to the MaxbitDepth of the current block. The value of the mask is between 1 and 15.

[0234] The MaxbitDepth mask is preferably encoded using a 15-symbol Huffman table (see Table 1). As shown, the four mask values that correspond to the most common mask patterns, where just one subblock having a MaxbitDepth equal to the MaxbitDepth of the parent block, are encoded with just three bits. TABLE 1 Huffman Table for Encoding MaxbitDepth Mask Mask Huffman Code 0001  111 0010  101 0011 1001 0100  011 0101 0010 0110 10000  0111 01001  1000  110 1001 01000  1010 0001 1011 00110  1100 0101 1101 00111  1110 0000 1111 10001 

[0235] Encoding Subblock MaxbitDepth Values

[0236] In addition, step 301 includes encoding the MaxbitDepth value for each of the subblocks whose MaxbitDepth is not equal to the MaxbitDepth m of the current block. For instance as shown in FIGS. 14A and 14B, if the MaxbitDepth values for the current block are

m₁, m₂, m₃, m₄=5, 0, 3, 2

[0237] then the only MaxbitDepth values that need to be encoded are m₂, m₃, m₄, because the MaxbitDepth value of m₁ is known from the MaxbitDepth mask and the previous stored and encoded value of the MaxbitDepth m₀ of the current block.

[0238] It should be noted that if m₀=1, then there is no need to encode the MaxbitDepth values of the subblocks, because those values are known completely from the MaxbitDepth mask.

[0239] If m₀≠1, then for each m₁≠m₀, the procedure encodes the value m₁ as follows:

[0240] m₁=0, then the procedure outputs a string of 0's of length m₀−1; and

[0241] otherwise, the procedure outputs a string of 0's of length m₀−m₁−1 followed by a 1.

[0242] For instance, if m₀=5 and m₁=0, then m₁ is encoded as a string of four 0's: 0000. If m₀=5 and m₂=3, then m₂ is encoded as string of (5−3−1=1) one 0 followed by a 1:01.

[0243] In the example of {m₁, m₂, m₃, m₄}={5, 0, 3, 2}, the MaxbitDepth values are encoded as follows:

[0244] mask m₂ Subblock m₃ Subblock m₄ Subblock

[0245] 111 0000 01 001

[0246] Next, if the coefficients of the NQS subband being encoded are to be stored in two or more bitstreams, then the encoded representation of the MaxbitDepth values for the block is divided into two more portions, with each portion containing the information content for a certain range of bit planes. For ease of explanation, an explanation in detail is provided as to how the MaxbitDepth values and mask and coefficient values are split between two portions, herein called the significant and insignificant portions. The same technique is used to split these values between three bit plane ranges corresponding significant, mid-significant and insignificant for least significant) portions.

[0247] For each NQS subband, excluding the last group of NQS subbands, the coefficient bit planes are divided into two or three ranges. When there are two bit plane ranges, a bit plane threshold that divided the two ranges is chosen or predefined. The “insignificant” portion of each “coefficient value” (including its MaxbitDepth value) below the bit plane threshold is stored in an “insignificant” bitstream 206 (see FIG. 8D), and the rest of the coefficient is stored in the corresponding significant bitstream 206. Selection of the bit plane ranges is typically done on an experimental basis, but encoding numerous images using various bit plane ranges, and then selecting a set of bit plane ranges that, on average, achieves specified division of data between the bitstreams for the various resolution levels. For example, the specified division may be an approximately equal division of data between the bitstream for a first resolution level and the next resolution level. Alternately, the specified division may call for the bitstreams for a second resolution level to contain four times as much data as the bitstreams for a first (lower) resolution level.

[0248] The splitting of MaxbitDepth values between significant and insignificant portions will be addressed initially, and then the encoding and splitting of coefficient values for minimum size blocks will be addressed.

[0249] If the MaxbitDepth m₀ of a block is less than the threshold, the MaxbitDepth mask and every bit of the MaxbitDepth values for the subblocks are stored in the insignificant portion of the base image subfile. Otherwise, the MaxbitDepth mask is stored in the significant part, and then each of the encoded subblock MaxbitDepth values are split between significant and insignificant parts as follows. This splitting is handled as follows m₁≧threshold, the entire encoded MaxbitDepth value m₁ is included in the significant portion of the subimage subfile. Otherwise, the first m₀ threshold bits of each MaxbitDepth value m₁, excluding m₁=m₀, are stored in the significant portion of the subimage subfile and the remaining bits of each m₁ (if any) are stored in the insignificant portion of the subimage subfile.

[0250] If the bit planes of the coefficients are to be divided into three ranges, then two bit plane thresholds are chosen or predefined, and the MaxbitDepth mask and values are allocated among three bitstreams using the same technique as described above.

[0251] Encoding Coefficient Values for Minimum Size Block

[0252] Next, if the size of the current block (i.e., the number of coefficient values in the current block) is not a predefined minimum number (302-No), such as four, then the Block procedure is called for each of the four subblocks of the current block (303). This is a recursive procedure call. As a result of calling the Block procedure on a subblock, the MaxbitDepth mask and values for the subblock are encoded and inserted into the pair of bitstreams for the subband group being encoded. If the subblock is not of the predefined minimum size, then the Block procedure is recursively called on its subblocks, and so on.

[0253] When a block of the predefined minimum size is processed by the block procedure (302-Yes), after the MaxbitDepth mask for the block and the MaxbitDepth values of the subblocks have been encoded (301), the coefficients of the block are encoded, and the encoded values are split between significant and insignificant parts (304).

[0254] Each coefficient that is not equal to zero includes a POS/NEG bit to indicate its sign, as well as a MaxbitDepth number of additional bits. Further, the MSB (most significant bit) of each non-zero coefficient, other than the sign bit, is already known from the MaxbitDepth value for the coefficient, and in fact is known to be equal to 1. Therefore, this MSB does not need to be encoded (or from another viewpoint, it has already been encoded with the MaxbitDepth value).

[0255] For each coefficient of a minimum size block, if the MaxbitDepth of the coefficient is less than the threshold, then all the bits of the coefficient, including its sign bit, are in the insignificant portion. Otherwise, the sign bit is in the significant portion, and furthermore the most significant bits (MSG's), if any, above the threshold number of least significant bits (LSB's), are also included in the significant portion. In other words, the bottom “threshold” number of bits are allocated to the insignificant portion. However, if the MaxbitDepth is equal to the threshold, the sign bit is nevertheless allocated to the significant portion and the remaining bits are allocated to the insignificant portion.

[0256] Furthermore, as noted above, since the MSE of the absolute value of each coefficient is already known from the MaxbitDepth mask and values, that bit is not stored. Also, coefficients with a value of zero are not encoded because their value is fully known from the MaxbitDepth value of the coefficient, which is zero.

[0257] For example (see FIG. 14C), consider four coefficients {31, 0 −5, −2} of a block whose values are with binary values are POS 11111, 0, NEG 101, NEG 10, and a threshold value of 3. First the zero value coefficients and the MSB's of the non-zero coefficient are eliminated to yield: POS 1111, NEG 01, NEG 0. Then the threshold number of least significant bits (other than sign bits) are allocated to the insignificant portion and the rest are allocated to the significant portion as follows:

[0258] significant portion: POS 1, NEG

[0259] insignificant portion: 111, 01, NEG 0.

[0260] The significant portion contains the most significant bits of the 31 and −5 coefficient values, while the insignificant portion contains the remaining bits of the 31 and −5 coefficient values and all the bits of the −2 coefficient value. TABLE 2 Pseudocode for Block Encoding Procedure //Encode MaxbitDepth m_(i) for each subblock i: Determine MaxbitDepth m_(i) for each subblock i =1, 2, 3, 4 mask=(m₀==m₁)+( m₀==m₂)+( m₀==m₃)+( m₀==m₄) //where the ″+″ in the above equation represents concatenation Encode and store mask using Huffman table For i=1 to 4{  If m_(i)≠m₀ {   if m_(i)=0 {    output a string of m₀ 0's }   else {  //m_(i)≠0    output a string of m₀-m_(i) 0's, followed by a 1 }   }  } // Divide the encoded MaxbitDepth mask and MaxbitDepth between // significant and insignificant portions as follows: If m₀<threshold {  output the MaxbitDepth mask and MaxbitDepth values to insignificant bitstream } else {  output the MaxbitDepth mask to significant bitstream;  for i =1 to 4 {   if m_(i)=m₀ {output nothing for that m_(i)}   else {    if m_(i)≧threshold { output m_(i) to significant bitstream }   else {    output the first m ₀-threshold bits of m_(i) to the significant bitstream    and output the remaining bits of m_(i) (if any) in the insignificant    bitstream }    }   }   } // Encode Coefficient values if block is of minimum size If size of current block is > minimum block size {  // coefficient values are denoted as c_(i)  for i =1 to 4 {   Call Block(subblock i);   }  else {   // size of current block is≦minimum block size   C = number of coefficients in block; // if block size is already known,   skip this step for i=1 to C {    if m_(i)<threshold {     output all bits of c_(i) to insignificant bitstream;     {    else {     output sign(c_(i)) to the significant bitstream;     if m_(i) >threshold {      #M = m_(i) − threshold − 1; // #M ≧ 0      output the #M most significant bits to the significant bitstream;      }     output all remaining least significant bits of c_(i) to the insignificant bitstream;     }    } // end of coefficient processing loop   }  // end of main else clause  }   // end of procedure Return

[0261] As discussed above, if the bit planes of the coefficients are to be divided into three ranges, then two bit plane thresholds are chosen or predefined, and the encoded coefficient values are allocated among three bitstreams using the same technique as described above.

[0262] Image Reconstruction

[0263] To reconstruct an image from an image file, at a specified resolution level that is equal to or lower than the resolution level at which the base image in the file was encoded, each bitstream of the image file up to the specified resolution level is decompressed and dequantized. Then, on a tile by tile basis the reconstructed transform coefficients are inverse transformed to reconstruct the image data at specified resolution level.

[0264] Referring to FIG. 15 the image reconstruction process reconstructs an image from image data received from an image file (320). A user of the procedure or device performing the image reconstruction, or a control procedure operating on behalf of a user, selects or specifies a resolution level R that is equal to or less than the highest resolution level included in the image data (322). A header of the image data file is read to determine the number and arrangement of tiles (L, K) in the image, and other information that may be needed by the image reconstruction procedure (323). Steps 324 and 326 reconstruct the image at the given resolution level, and at step 328 the reconstructed image is displayed or stored in a memory device. FIGS. 16A and 16B provide a more detailed view of the procedure for decoding the data for a particular tile at a particular subimage level.

[0265] In one embodiment, as shown in FIG. 15, the data in the image file relevant to the specified resolution level is initially reorganized into tile by tile subfiles, with each tile subfile containing the bitstreams for that tile (324). Then, the data for each tile is processed (326). The header information is read to determine the MaxbitDepth for each top level subband block of the tile, the quantization factor used to quantize each subimage subband, and the like. The transform coefficients for each NQS subband required to reconstruct the image at the specified resolution level are decoded, in subband order. The details of the decoding process for decoding the coefficients in any one NQS subband are discussed below with reference to FIG. 16B. The resulting decoded coefficients are de-quantized applying the quantization factors for each subband (obtained from the Q table identified in the base image header). Then an inverse transform is applied to the resulting de-quantized coefficients. Note that the wavelet-like inverse transforms for reconstructing an image from the dequantized transform coefficients have been described above.

[0266] Referring to FIG. 16A, to decode the data for one tile t at a specified resolution level, a set of steps 340 are repeated to decode each NQS subband of the tile, excluding those NQS subbands not needed for the specified resolution level and also excluding any bitstreams containing bit planes of encoded coefficient values not needed for the specified resolution level. Referring to FIGS. 8D and 8E, only the bitstreams of the base image needed to the specified resolution level are decoded. For a particular top level block (corresponding to a NQS subband) of the tile being decoded, the MaxbitDepth of the top level block is determined from either the header of the tile array (if the data has been reorganized into tile arrays) or from the data at the beginning of the bitstream(S) for the subband (346), and then the Decode-Block procedure is called to decode the data for the current block (348).

[0267] After the data for a particular subband has been decodeed, the decoded transform coefficients for that subband may be de-quantized, applying the respective quantization factor for the respective (350). Alternately, de-quantization can be performed after all coefficients for all the subband have been decoded.

[0268] Once all the coefficients for the NQS subbands have been decoded and de-quantized, an inverse transform is performed so as to regenerate the image data for the current tile t at the specified resolution level (352).

[0269] In an alternate embodiment, step 324 of FIG. 15 is not used and the data in the image file is not reorganized into tile arrays. Rather, the image data is processed on a subband group by subband group basis, requiring the recovered transform coefficients for all the tiles to be accumulated and stored during the initial reconstruction steps. The steps 340 for decoding the data for one top level block of a particular tile for a particular subband group are repeated for each tile. In particular, for a particular top level block of a particular tile of a particular subband group, the MaxbitDepth of the top level block is determined from either the header of the tile array or from the data at the beginning of the bitstream(s) for the subband group (346), and then the Decode-Block procedure is called to decode the data for the current block (348).

[0270] Referring to FIG. 16B, the Decode-Block procedure (which is applicable to both the preferred and alternate embodiments mentioned in the preceding paragraphs) begins by decoding the MaxbitDepth data in the applicable encoded data array so as to determine the MaxbitDepth of each subblock of the current block (360). Depending on the NQS subband being decoded, the MaxbitDepth data for a block may be in one bitstream or may be split between two or three bitstreams, as described above, and therefore the applicable MaxbitDepth data bits from all required bitstreams will be read and decoded. If the size of the current block is greater than a predefined minimum block size (362-No), then the Decode-Block procedure is called for each of the subblocks of the current block (363). This is a recursive procedure call. As a result of calling the Decode-Block procedure on a subblock, the MaxbitDepth values for the subblock are decoded If that subblock is not of the predefined minimum size, then the Decode-Block procedure is recursively called on its subblocks, and so on. When a block of the predefined minimum size is processed by the Decode-Block procedure (362-Yes), the coefficients of the block are decoded. Depending on the subband group being decoded, the encoded coefficients for a block may be in one bitstream or maybe split between two or three bitstreams, as described above, and therefore the applicable, data bits from all required bitstreams will be read and decoded. Referring to FIG. 16A, the quantized transform coefficients for each tile are regenerated for all NQS subbands included in the specified resolution level. After these coefficients have been de-quantized, the inverse transform is applied to each tile (352), as already described.

[0271] Embodiment Using Non-Alternating Horizontal and Vertical Transforms

[0272] In another embodiment, each tile of the image is first processed by multiple (e.g., five) horizontal decomposition transform layers and then by a similar number of vertical decomposition transform layers. Equivalently, the vertical transform layers could be applied before the horizontal transform layers. In hardware implementations of the image transformation methodology described herein, this change in the order of the transform layers has the advantage of either (A) reducing the number of times the data array is rotated, or (B) avoiding the need for circuitry that switches the roles of rows and columns in the working image array(s). When performing successive horizontal transforms, the second horizontal transform is applied to the leftmost array of low frequency coefficients generated by the first horizontal transform, and the third horizontal transform is applied to the leftmost array of low frequency coefficients generated by the second horizontal transform, and so on. Thus, the second through Nth horizontal transforms are applied to twice as much day as in the transform method in which the horizontal and vertical transforms alternate. However, this extra data processing generally does not take any additional processing time in hardware implementations because in such implementations the horizontal filter is applied simultaneously to all rows of the working image array. The vertical transforms are applied in succession to successively smaller subarrays of the working image array. After the image data has been transformed by all the transform layers to (both horizontal and vertical), the quantization and encoding steps described above are applied to the resulting transform coefficients to complete the image encoding process.

[0273] As explained above, different (and typically shorter) transform filters may be applied to coefficients near the edges of the arrays being processed than the (typically longer) transform filter applied to coefficients away from those array edges. The use of longer transform filters in the middle provides better data compression than the shorter transform filters, while the shorter transform filters eliminate the need for data and coefficients from neighboring tiles.

[0274] Digital Camera Architecture

[0275] Referring to FIG. 17, there is shown an embodiment of a digital camera system 400. The digital camera system 400 includes an image capture device 402, such as a CCD or CMOS sensor array or any other mechanism suitable for capturing an image as an array of digitally encoded information. The image capture device is assumed to include analog to digital conversion (ADC) circuitry for converting analog image information into digital values. A working memory 404, typically random access memory, receives digitally encoded image information from the image capture device 402. More generally, it is used to store a digitally encoded image while the image is being transformed and compressed and otherwise processed by the camera's data (i.e., image) processing circuitry 406. In one embodiment, the data processing circuitry 406 consists of hardwired logic and a set of state machines for performing a set of predefined image processing operations.

[0276] In alternate embodiments, the data processing circuitry 406 could be implemented in part or entirely using a fast general purpose microprocessor and a set of software procedures. However, at least using the technology available in 2000, it would be difficult to process and store full resolution images (e.g., full color images having 1280×840 pixels) fast enough to enable the camera to be able to take, say, 20 pictures per second, which is a requirement for some commercial products. If, through the use of parallel processing techniques or well designed software, a low power, general purpose image data microprocessor could support the fast image processing needed by digital cameras, then the data processing circuit 106 could be implemented using such a general purpose microprocessor.

[0277] Each image, after it has been processed by the data processing circuitry 406, is typically stored as an “image file” in a nonvolatile memory storage device 408, typically implemented using “flash” (i.e., EEPROM) memory technology. The nonvolatile memory storage device 408 is preferably implemented as a removable memory card. This allows the camera's user to remove one memory card, plug in another, and then take additional pictures. However, in some implementations, the nonvolatile memory storage device 408 may not be removable, in which case the camera will typically have a data access port 410 to enable the camera to transfer image files to and from other devices, such as general purpose, desktop computers.

[0278] Digital cameras with removable nonvolatile memory 408 may also include a data access port. The digital camera 400 includes a set of buttons 412 for giving commands to the camera. In addition to the image capture button, there will typically be several other buttons to enable the use to select the quality level of the next picture to be taken, to scroll through the images in memory for viewing on the camera's image viewer 414, to delete images from the nonvolatile image memory 408, and to invoke all the camera's other functions. Such other functions might include enabling the use of a flash light source, and transferring image files to and from a computer. In one embodiment, the buttons are electromechanical contact switches, but in other embodiments at least some of the buttons may be implemented as touch screen buttons on a user interface display 416, or on the image viewer 414.

[0279] The user interface display 416 is typically implemented either (A) as an LCD display device separate from the image viewer 414, or (B) as images displayed on the image viewer 414. Menus, user prompts, and information about the images stored in the nonvolatile image memory 108 may be displayed on the user interface display 416, regardless of how that display is implemented.

[0280] After an image has been captured, processed and stored in nonvolatile image memory 408, the associated image file may be retrieved from the memory 408 for viewing on the image viewer. More specifically, the image tile is converted from its transformed, compressed form back into a data array suitable for storage in a framebuffer 418. The image data in the framebuffer is displayed on the image viewer 414. A date/time circuit 420 is used to keep track of the current date and time, and each stored image is date stamped with the date and time that the image was taken.

[0281] Still referring to FIG. 17, the digital camera 400 preferably includes data processing circuitry for performing a predefined set of primitive operations, such as performing, the multiply and addition operations required to apply a transform to a certain amount of image data as well as a set of state machines 430-442 for controlling the data processing circuitry so as to perform a set of predefined image handling operations. In one embodiment, the state machines in the digital camera are as follows:

[0282] One or more state machines 430 for transforming, compressing and storing an image received from the camera's image capture mechanism. This image is sometimes tilled the “viewfinder” image, since the image being processed is generally the one seen, on the camera's image viewer 414. This set of state machines 430 are the ones that each image file stored in the nonvolatile image memory 408. Prior to taking the picture, the user specifies the quality level of the image to be stored using the camera's buttons 412. In one embodiment, the image encoding state machines 430 implement one or more features described above.

[0283] One or more state machines 432 for decompressing, inverse transforming and displaying a stored image tile on the camera's image viewer. The reconstructed image generated by decompressing, inverse transforming and dequantizing the image data is stored in camera's framebuffer 418 so that it can be viewed on the image viewer 414.

[0284] One or more state machines 434 for updating and displaying a count of the number of images stored in the nonvolatile image memory 408. The image count is preferably displayed on the user interface display 416. This set of state machines 434 will also typically indicate what percentage of the nonvolatile image memory 408 remains unoccupied by image files, or some other indication of the camera's ability to store additional images. If the camera does not have a separate interface display 416, this memory status information may be shown on the image viewer 414, for instance superimposed on the image shown in the image viewer 414 or shown in a region of the viewer 414 separate from the main viewer image.

[0285] One or more state machines 436 for implementing a “viewfinder” mode for the camera in which the image currently “seen” by the image capture mechanism 402 is displayed on the image viewer 414 so that the user can see the image that would be stored if the image capture button is pressed. These state machines transfer the image received from the image capture device 402, possibly after appropriate remedial processing steps are performed to improve the raw image data, to the camera's framebuffer 418.

[0286] One or more state machines 438 for downloading images from the nonvolatile image memory 408 to an external device, such as a general purpose computer (one or more state machines 440 for uploading images from an external device, such as a general purpose computer, into the nonvolatile image memory 408. This enables the camera to be used as an image viewing device, and also as a mechanism for transferring image files on memory cards.

[0287] Alternate Embodiments

[0288] Generally, the present invention is useful in any “memory conservative” context where the amount of working memory available is insufficient to process entire images as a single tile, or where a product must work in a variety of environments including low memory environments, or where an image may need to be conveyed over a low bandwidth communication channel or where it may be necessary or convenient to providing image at a variety of resolution levels.

[0289] In streaming data implementations, such as in a web browser that receives compressed images encoded using the present invention, subimages of an image may be decoded and decompressed on the fly, as the data for other higher level subimages of the image are being received. As a result, one or more lower resolution versions of the compressed image may be reconstructed and displayed before the data for the highest resolution version of the image is received (and/or decoded) over a communication channel.

[0290] In another alternate embodiment, a different transform than the wavelet-like transform described above could be used.

[0291] In alternate embodiments, the image tiles could be processed in a different order. For instance, the image tiles could be processed from right to left instead of left to right. Similarly, image tiles could be processed starting at the bottom row and proceeding toward the top row.

[0292] The present invention can be implemented as a computer program product that includes a computer program mechanism embedded in a computer readable storage medium. For instance, the computer program product could contain the program modules shown in FIG. 5. These program modules may be stored on a CD-ROM, magnetic disk storage product, or any other computer readable data or program storage product. The software modules in the computer program product may also be distributed electronically, via the Internet or otherwise, by transmission of a computer data signal (in which the software modules are embedded) on a carrier wave.

[0293] While the present invention has been described with reference to a few specific embodiments, the description is illustrative of the invention and is not to be construed as limiting the invention. Various modifications may occur to those skilled in the art without departing from the true spirit and scope of the invention as defined by the appended claims.

[0294] Whereas many alterations and modifications of the present invention will no doubt become apparent to a person of ordinary skill in the art after having read the foregoing description, it is to be understood that any particular embodiment shown and described by way of illustration is in no way intended to be considered limiting. Therefore, references to details of various embodiments are not intended to limit the scope of the claims which in themselves recite only those features regarded as essential to the invention. 

I claim:
 1. A method for creating an image at different resolutions with a scalable graphic, the method comprising: selecting a version of the image for display with the scalable graphic, the version of the image being at one of a plurality of resolutions; and generating the version of the image from a first compressed image bitstream from which versions of the image at two or more of the plurality of resolutions could be generated, a first of the versions being generated using a first portion of the first compressed image bitstream and a second of the versions being generated using the first portion of the first compressed image bitstream and a second portion of the first compressed image bitstream.
 2. The method defined in claim 1 wherein quality of the second version of the image is at least as good as quality of the first version of the image.
 3. The method defined in claim 1 wherein the graphic comprises a Scalable Vector Graphics (SVG) graphic.
 4. The method defined in claim 3 wherein the first version includes the SVG graphic at a first size and the second version includes the SVG graphic at a second size, such that the SVG graphic appears at different sizes on the image.
 5. The method defined in claim 1 wherein the second version of the image is an enlarged version of the first version of the image.
 6. The method defined in claim 1 further comprising obtaining the scalable graphic using a link.
 7. The method defined in claim 1 further comprising obtaining the scalable graphic from a server.
 8. The method defined in claim 1 further comprising obtaining one version of the scalable graphic from a plurality of available versions, each of the plurality of available versions being a different size.
 9. The method defined in claim 8 further comprising selecting the one version based on available bandwidth of a link over which the scalable graphic is obtained, the one version being the highest quality using the plurality of versions that may be sent based on a the available bandwidth.
 10. The method defined in claim 1 wherein the first image bitstream comprises compressed data and at least a portion of the compressed is decompressed to generate any of the versions of the image.
 11. The method defined in claim 1 wherein the first image bitstream is pyramidal, such that each level of decomposition represents the image at one of the plurality of resolutions.
 12. The method defined in claim 11 further comprising storing only a lowest level of decomposition, and generating all other levels from the lowest level of decomposition.
 13. The method defined in claim 1 further comprising generating another version of the image from a second image bitstream from which versions of the image at two or more of the plurality of resolutions could be generated, a first of the versions being generated using a first portion of the second image bitstream and a second of the versions being generated using the first portion of the second image bitstream and a second portion of the second image bitstream.
 14. An article of manufacture having one or more recordable media having executable instructions stored thereon which, when executed by a system, cause the system to: select a version of an image for display with a scalable graphic, the version of the image being at one of a plurality of resolutions; and generate the version of the image from a first compressed image bitstream from which versions of the image at two or more of the plurality of resolutions could be generated, a first of the versions being generated using a first portion of the first compressed image bitstream and a second of the versions being generated using the first portion of the first compressed image bitstream and a second portion of the first compressed image bitstream.
 15. The article of manufacture defined in claim 14 wherein quality of the second version of the image is at least as good as quality of the first version of the image.
 16. The article of manufacture defined in claim 14 wherein the graphic comprises a Scalable Vector Graphics (SVG) graphic.
 17. The article of manufacture defined in claim 16 wherein the first version includes the SVG graphic at a first size and the second version includes the SVG graphic at a second size, such that the SVG graphic appears at different sizes on the image.
 18. The article of manufacture defined in claim 14 wherein the second version of the image is an enlarged version of the first version of the image.
 19. The article of manufacture defined in claim 14 further comprising executable instructions which, when executed by a system, cause the system to obtain the scalable graphic from a server.
 20. The article of manufacture defined in claim 14 further comprising executable instructions which, when executed by a system, cause the system to obtain one version of the scalable graphic from a plurality of available versions, each of the plurality of available versions being a different size.
 21. The article of manufacture defined in claim 20 further comprising executable instructions which, when executed by a system, cause the system to select the one version based on available bandwidth of a link over which the scalable graphic is obtained, the one version being the highest quality using the plurality of versions that may be sent based on a the available bandwidth.
 22. The article of manufacture defined in claim 14 wherein the first image bitstream comprises compressed data and at least a portion of the compressed is decompressed to generate any of the versions of the image.
 23. The article of manufacture defined in claim 14 wherein the first image bitstream is pyramidal, such that each level of decomposition represents the image at one of the plurality of resolutions.
 24. The article of manufacture defined in claim 23 further comprising executable instructions which, when executed by a system, cause the system to store only a lowest level of decomposition and generate all other levels from the lowest level of decomposition.
 25. The article of manufacture defined in claim 14 further comprising executable instructions which, when executed by a system, cause the system to generate another version of the image from a second image bitstream from which versions of the image at two or more of the plurality of resolutions could be generated, a first of the versions being generated using a first portion of the second image bitstream and a second of the versions being generated using the first portion of the second image bitstream and a second portion of the second image bitstream. 